Implementing data cubes efficiently

DMCA

Implementing data cubes efficiently (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Venky Harinarayan , Anand Rajaraman , Jeffrey D. Ulman

Venue:	In SIGMOD
Citations:	542 - 1 self

BibTeX

@INPROCEEDINGS{Harinarayan96implementingdata,
    author = {Venky Harinarayan and Anand Rajaraman and Jeffrey D. Ulman},
    title = {Implementing data cubes efficiently},
    booktitle = {In SIGMOD},
    year = {1996}
}

OpenURL

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. 1

Keyphrases

data cube powerful query optimization technique materialized view greedy algorithm performs total sale query optimization lattice framework commercial system complex query hypercube lattice good tradeoff average time small constant factor multidimensional data cube common case raw data response time present greedy algorithm decision support application large database good set

DMCA