Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Path constraints on semistructured and structured data
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extending Practical Pre-Aggregation in On-Line Analytical Processing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
What can Hierarchies do for Data Warehouses?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Summarizability in OLAP and Statistical Data Bases
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Querying Multidimensional Databases
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Multidimensional Data Modeling for Complex Data
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
A Decathlon in Multidimensional Modeling: Open Issues and Some Solutions
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Multidimensional databases
Colorful XML: one hierarchy isn't enough
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Concise descriptions of subsets of structured sets
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Bridging the gap between OLAP and SQL
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Capturing summarizability with integrity constraints in OLAP
ACM Transactions on Database Systems (TODS)
Research in data warehouse modeling and design: dead or alive?
DOLAP '06 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP
A data quality metamodel extension to CWM
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
OLAP over imprecise data with domain constraints
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Upper Borders for Emerging Cubes
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
A Conceptual Modeling Framework for Expressing Observational Data Semantics
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
Reduced representations of Emerging Cubes for OLAP database mining
International Journal of Business Intelligence and Data Mining
Multiversion data warehouse constraints
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Inferring multidimensional cubes for representing conceptual document spaces
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
A taxonomy of inaccurate summaries and their management in OLAP systems
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
Multidimensional integrated ontologies: a framework for designing semantic data warehouses
Journal on Data Semantics XIII
A unified object constraint model for designing and implementing multidimensional systems
Journal on Data Semantics XIII
A multidimensional data model with subcategories for flexibly capturing summarizability
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a directed graph of categories, a set of members for each category, and a child/parent relation between members. An important application of this structure is to use it to infer summarizability, that is, whether an aggregate view defined for some category can be correctly derived from a set of precomputed views defined for other categories. A dimension is called heterogeneous if two members in a given category are allowed to have ancestors in different categories. In previous work, we studied the problem of inferring summarizability in a particular class of heterogeneous dimensions. In this paper, we propose a class of integrity constraints and schemas that allow us to reason about summarizability in general heterogeneous dimensions. We introduce the notion of frozen dimensions, which are minimal homogeneous dimension instances representing the different structures that are implicitly combined in a heterogeneous dimension. Frozen dimensions provide the basis for efficiently testing implication of dimension constraints, and are useful aid to understanding heterogeneous dimensions. We give a sound and complete algorithm for solving the implication of dimension constraints, that uses heuristics based on the structure of the dimension and the constraints to speed up its execution. We study the intrinsic complexity of the implication problem, and the running time of our algorithm.