Yannis Kotidis
ABSTRACT
The Relational On-Line Analytical Processing (ROLAP) is emerging as the dominant approach in data warehousing with decision support applications. In order to enhance query performance, the ROLAP approach relies on selecting and materializing in summary tables appropriate subsets of aggregate views which are then engaged in speeding up OLAP queries. However, a straight forward relational storage implementation of materialized ROLAP views is immensely wasteful on storage and incredibly inadequate on query performance and incremental update speed. In this paper we propose the use of Cubetrees, a collection of packed and compressed R-trees, as an alternative storage and index organization for ROLAP views and provide an efficient algorithm for mapping an arbitrary set of OLAP views to a collection of Cubetrees that achieve excellent performance. Compared to a conventional (relational) storage organization of materialized OLAP views, Cubetrees offer at least a 2-1 storage reduction, a 10-1 better OLAP query performance, and a 100-1 faster updates. We compare the two alternative approaches with data generated from the TPC-D benchmark and stored in the Informix Universal Server (IUS). The straight forward implementation materializes the ROLAP views using IUS tables and conventional B-tree indexing. The Cubetree implementation materializes the same ROLAP views using a Cubetree Datablade developed for IUS. The experiments demonstrate that the Cubetree storage organization is superior in storage, query performance and update speed.
- AAD+96.S. Agrawal, R. Agrawal, R Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Sarawagi. On the Computation of Multidimensional Aggregates. In Proc. of VLDB, pages 506-521, Bombay, India, August 1996. Google Scholar
Digital Library
- ACT97.ACT Inc. The Cubetree Datablade. August 1997.Google Scholar
- BPT97.E. Baralis, S. Paraboschi, and E. Teniente. Materialized View Selection in a Multidimensional Database. in Proc. of the 23th b~ternational Conference on VLDB, pages 156-165, Athens, Greece, August 1997. Google ScholarDigital Library
- FR89.C. Faloutsos and S. Roseman. Fractals for Secondary Key Retrieval. Eighth ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems (PODS), pages 247-252, March 1989. Google ScholarDigital Library
- GBLP96.J. Gray, A. Bosworth, A. Layman, and H. Piramish. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. In Proc. of the 12th Int. Conference on Data Engineering, pages 152-159, New Orleans, February 1996. IEEE. Google ScholarDigital Library
- GHRU97.H. Gupta, V. ttarinarayan, A. Rajaraman, and J. Ullman. Index Selection for OLAP. In Proceedings of the Intl. Conf. on Data Engineering, pages 208-219, Burmingham, UK, April 1997. Google ScholarDigital Library
- GL95.T. Griffin and L. Libkin. Incremental Maintenance of Views with Duplicates. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 328-339, San Jose, CA, May 1995. Google ScholarDigital Library
- GMS93.A. Gupta, {.S. Mumick, and V.S. Subrahmanian. Maintaining Views Incrementally. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 157-166, Washington, D.C., May 1993. Google ScholarDigital Library
- Gup97.H. Gupta. Selections of Views to Materialize in a Data Warehouse. In Proceedings of lCDT, pages 98-i12, Delphi, January 1997. Google ScholarDigital Library
- Gut84.A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching~ In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 47-57, Boston, MA, June 1984. Google ScholarDigital Library
- HRU96.V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing Data Cubes Efficiently. In Proc. ofACM SIG- MOD, pages 205-216, Montreal, Canada, June 1996. Google ScholarDigital Library
- JMS95.H. Jagadish, |. Mumick, and A. Silberschatz. View Maintenance Issues in the Chronicle Data Model. In Proceedings of PODS, pages 113-124, San Jose, CA, 1995. Google ScholarDigital Library
- Kim96.R. Kimball. The Data Warehouse Toolkit. John Wiley & Sons, 1996.Google Scholar
- KR97.Y. Kotidis and N. Roussopoulos. A Generalized Framework for Indexing OLAP Aggregates. Technical Report CS-TR-3841, University of Maryland, Oct 1997.Google Scholar
- MQM97.I.S. Mumick, D. Quass, and B. S. Mumick. Maintcnance of Data Cubes and Summary Tables in a Warehouse. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 100- 111, Tucson, Arizona, May 1997. Google ScholarDigital Library
- OG95.R O'Neil and G. Graefe. Multi-Table Joins Through Bitmapped Join Indices. SIGMOD Record, 24(3):8-11, Sept 1995. Google ScholarDigital Library
- OQ97.R O'Neil and D. Quass. Improved Query Performance with Variant Indexes. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 38--49, Tucson, Arizona, May 1997. Google ScholarDigital Library
- RKR97.N. Roussopoulos, Y. Kotidis, and M. Roussopoulos. Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. In Proceedings of the A CM SIGMOD international Conference on Management of Data, pages 89-99, Tucson, Arizona, May 1997. Google ScholarDigital Library
- RL85.N. Roussopoulos and D. Leifker. Direct Spatial Search on Pictorial Databases Using Packed R-trees. In Procs. of 1985 A CM SIGMOD Intl. Conf. on Management of Data, Austin, 1985. Google ScholarDigital Library
- Rou82.N. Roussopoulos. View Indexing in Relational Databases. A CM TODS, 7(2), June 1982. Google ScholarDigital Library
- Sar97.S. Sarawagi. Indexing OLAP Data. IEEE Bulletin on Data Engineering, 20(1 ):36-43, March 1997.Google Scholar
- Val87.P. Valduriez. Joinindices. ACMTODS, 12(2):218-246, 1987. Google ScholarDigital Library
- ZDN97.Y. Zhao, P. M. Deshpande, and J. E Naughton. An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. In Proceedings of the A CM SIG- MOD International Conference on Management of Data, pages 159-170, Tucson, Arizona, May 1997. Google ScholarDigital Library
Index Terms
- An alternative storage organization for ROLAP aggregate views based on cubetrees
Recommendations
An alternative storage organization for ROLAP aggregate views based on cubetrees
The Relational On-Line Analytical Processing (ROLAP) is emerging as the dominant approach in data warehousing with decision support applications. In order to enhance query performance, the ROLAP approach relies on selecting and materializing in summary ...
Processing Aggregate Queries with Materialized Views in Data Warehouse Environment
Materialized views, which are derived from base relations and stored in the database, offer opportunities for significant performance gain in query evaluation by providing quick access to the pre-computed data. A materialized view can be utilized in ...
On the content of materialized aggregate views
PODS '00: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsWe consider the problem of answering queries using only materialized views. We first show that if the views subsume the query from the point of view of the information content, then the query can be answered using only the views, but the resulting query ...
Comments