ACM Home Page
Please provide us with feedback. Feedback
Implementing data cubes efficiently
Full text PdfPdf (1.24 MB)
Source ACM SIGMOD Record archive
Volume 25 ,  Issue 2  (June 1996) table of contents
Pages: 205 - 216  
Year of Publication: 1996
ISSN:0163-5808
Also published in ...
Authors
Venky Harinarayan  Stanford University
Anand Rajaraman  Stanford University
Jeffrey D. Ullman  Stanford University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 30,   Downloads (12 Months): 278,   Citation Count: 263
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/235968.233333
What is a DOI?

ABSTRACT

Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total sales. The values of many of these cells are dependent on the values of other cells in the data cube. A common and powerful query optimization technique is to materialize some or all of these cells rather than compute them from raw data each time. Commercial systems differ mainly in their approach to materializing the data cube. In this paper, we investigate the issue of which cells (views) to materialize when it is too expensive to materialize all views. A lattice framework is used to express dependencies among views. We present greedy algorithms that work off this lattice and determine a good set of views to materialize. The greedy algorithm performs within a small constant factor of optimal under a variety of models. We then consider the most common case of the hypercube lattice and examine the choice of materialized views for hypercubes in detail, giving some good tradeoffs between the space used and the average time to answer a query.


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.

 
Arb
Arbor Software. Multidimensional Analysis: (',onverting Corporate Data into Strategic Information. White Paper. At ht, tp://www.arborsoft.com/ papers / multiTO ( ~,. ht ml
 
Che96
C. Chekllri. Personal comnmnication, 1996.
 
CS94
Fei96
 
GBLP95
J..Gray, A. Bosworth, A. Layman, H. Pirahesh Data Cube: A Relational Aggregation ()perator Generalizing Group-By, Cross-Tab, and Sub- Totals. Microsoft TedmicaI Report No. MSR-TR- 95-22.
 
GHQ95
 
GHRU96
H. Gupta, V. Harinarayan, A. Rajaralnan, and J. D. Ulhnan. Index Selection for ()LAP. Sift> mitred for publication. At http://db.stanford.edu/ pub/hgupt a/1996 / CubeIndex. ps
Gra93
 
HRU95
V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing Data Cubes Efficiently. A flfll version of Lhis paper. At http://db.stanford.edu/ pllb / harinarayan / 1995 / cub e. ps
 
HNSS95
OG95
 
Raa95
F. Raab, editor. TPC, Benchmark(tin) D (Decision Support), Proposed Revision 1.0. Transaction Processing Performance Council, San Jose, CA 95112, 4 April 1995.
Rad95
 
STG
Stanford Technology Group, Inc. Designing the Data Warehouse On Relational Databases. White Paper.
 
Xen94
J. Xenakis, editor. Multidimensional Databases, tn Application Development Strategies, April 1994.

CITED BY  263

Collaborative Colleagues:
Venky Harinarayan: colleagues
Anand Rajaraman: colleagues
Jeffrey D. Ullman: colleagues