Ullman, J. (1996) *Efficient Implementation of Data Cubes via Materialized Views.* In: International Conference on Knowledge Discovery and Data Mining (KDD'96).

BibTeX | DublinCore | EndNote | HTML |

| PDF 97Kb |

## Abstract

Data cubes are specialized database management systems designed to support multidimensional data for such purposes as decision support and data mining. For a given mix of queries, we can optimize the implementation of a data cube by materializing some projections of the cube. A greedy approach turns out to be very effective; it is both pas a function of the number of possible views to materialize and guaranteed to come close to the optimum choice of views. The work reported here is a summary of results appearing in the following two papers: V. Harinarayan, A. Rajaraman, and J. D. Ullman, "Implementing data cubes effciently." To appear in 1996 SIGMOD. An extended version is available by anonymous ftp from db.stanford.edu as pub/harinarayan/1995/cube.ps. H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman, "Index selection for OLAP." Available by anonymous ftp from db.stanford.edu as pub/hgupta/1996/CubeIndex.ps.

Item Type: | Conference or Workshop Item (Paper) | |
---|---|---|

Subjects: | Computer Science > Data Integration and Mediation | |

Projects: | Information Integration | |

Related URLs: | Project Homepage | http://infolab.stanford.edu/serf/ |

ID Code: | 159 | |

Deposited By: | Import Account | |

Deposited On: | 25 Feb 2000 16:00 | |

Last Modified: | 09 Dec 2008 09:45 |

## Download statistics

Repository Staff Only: item control page