Implementing Data Cubes Efficiently

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

• Type: Conference
• Year: 1996
• Where: SIGMOD
• Authors: Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
• Keywords: Data Cube, Database, Multidimensional Data Cubes, Query Optimization, SIGMOD 1996