ACM Home Page
Please provide us with feedback. Feedback
OLAP dimension constraints
Full text PdfPdf (186 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Madison, Wisconsin
SESSION: Research session 6: OLAP and constraints table of contents
Pages: 169 - 179  
Year of Publication: 2002
ISBN:1-58113-507-6
Authors
Carlos A. Hurtado  University of Toronto
Alberto O. Mendelzon  University of Toronto
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 44,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/543613.543636
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
B. A. Goldstein. Constraints on null values in relational databases. In Proceedings of the 7th International Conference on Very Large Data Bases, Cannes, France, 1981.
 
5
C. Hurtado and A. Mendelzon. OLAP dimension constraints (extended version). In ftp.db.toronto.edu/pub/papers/fullpods02.ps.gz.
 
6
 
7
B. Huseman, J. Lechtenborger, and G. Vossen. Conceptual data warehouse design. In Proceedings of the International Workshop on Design and Management of Data Warehouses (DMDW), Stockholm, Sweden, 2000.
 
8
 
9
R. Kimball. The aggregate navigator. DBMS and Internet Systems Magazine, http://www.dbmsmag.com, November 1995.
 
10
R. Kimball. The Data Warehouse Toolkit. J. Wiley and Sons, Inc, 1996.
 
11
W. Lehner, H. Albrecht, and H. Wedekind. Multidimensional normal forms. In Proceedings of the 10th Statistical and Scientific Database Management Conference, Capri, Italy., 1998.
 
12
 
13
 
14

CITED BY  8

Collaborative Colleagues:
Carlos A. Hurtado: colleagues
Alberto O. Mendelzon: colleagues