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.

Keywords

HypercubeComputer scienceData cubeGreedy algorithmData warehouseMaterialized viewOnline analytical processingCube (algebra)Data structureTheoretical computer scienceData miningAlgorithmMathematicsCombinatoricsViewDatabase designParallel computing

Affiliated Institutions

Related Publications

Publication Info

Year
1996
Type
article
Pages
205-216
Citations
1161
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

1161
OpenAlex

Cite This

Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman (1996). Implementing data cubes efficiently. , 205-216. https://doi.org/10.1145/233269.233333

Identifiers

DOI
10.1145/233269.233333