Efficient Computation of Data Cubes and Aggregate Views

Efficient Computation of Data Cubes and Aggregate Views

Leonardo Tininini (CNR - Istituto di Analisi dei Sistemi e Informatica “Antonio Ruberti”, Italy)
Copyright: © 2005 |Pages: 6
DOI: 10.4018/978-1-59140-557-3.ch080
OnDemand PDF Download:
No Current Special Offers


This paper reviews the main techniques for the efficient calculation of aggregate multidimensional views and data cubes, possibly using specifically designed indexing structures. The efficient evaluation of aggregate multidimensional queries is obviously one of the most important aspects in data warehouses (OLAP systems). In particular, a fundamental requirement of such systems is the ability to perform multidimensional analyses in online response times. As multidimensional queries usually involve a huge amount of data to be aggregated, the only way to achieve this is by pre-computing some queries, storing the answers permanently in the database and reusing these almost exclusively when evaluating queries in the multidimensional database. These pre-computed queries are commonly referred to as materialized views and carry several related issues, particularly how to efficiently compute them (the focus of this paper), but also which views to materialize and how to maintain them.

Complete Chapter List

Search this Book: