Abstract
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge all previous work has focussed on the special case in which all aggregates are computed from a single cube (in a star schema, this corresponds to there being a single fact table). This is unfortunate, because many real world applications require aggregates over multiple fact tables. In this paper, we attempt to fill this lack of discussion about the issues arising in multi-cube data models by analyzing these issues. Then we examine performance issues by studying the precomputation problem for multi-cube systems. We show that this problem is significantly more complex than the single cube precomputation problem, and that algorithms and cost models developed for single cube precomputation must be extended to deal well with the multi-cube case. Our results from a prototype implementation show that for multi-cube workloads substantial performance improvements can be realized by using the multi-cube algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
APB-1 Benchmark, Release II, November 1998. Available from http://www.olapcouncil.org/research/bmarkly.htm.
E. Baralis, S. Paraboschi, E. Teniente. Materialized View Selection in a Multidimensional Database, Proc. of the 23rd Int. VLDB Conf., 1997.
R. Elmasri, S. Navathe, Fundamentals of Database Systems, The Benjamin/Cummings Publishing Company, Inc., 1989.
J. Gray, A. Bosworth, A. Layman, H. Pirahesh. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals, Proc. of the 12th Int. Conf. on Data Engg., pp 152–159, 1996.
H. Gupta, V. Harinarayan, A. Rajaraman, J.D. Ullman. Index Selection for OLAP. Proc. of the 13th ICDE, 208–219, 1997.
H. Gupta. Selection of Views to Materialize in a Data Warehouse. Proc. of the Sixth ICDT, 98–112, 1997.
V. Harinarayan, A. Rajaraman, J.D. Ullman. Implementing Data Cubes Effciently, Proc. ACM SIGMOD Int. Conf. on Man. of Data, 205–227, 1996.
Nigel Pendse and Richard Creeth, The Olap Report. Information available from http://www.olapreport.com/.
A. Shukla, P.M. Deshpande, J.F. Naughton, K. Ramasamy, Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies, Proc. of the 22nd Int. VLDB Conf., 522–531, 1996.
A. Shukla, P.M. Deshpande, J.F. Naughton, Materialized View Selection for Multi-dimensional Datasets, Proc. of the 24th Int. VLDB Conf., 1998.
A. Shukla, Materialized View Selection for Multidimensional Datasets, Ph.D. Dissertation, University of Wisconsin-Madison, 1999.
Erik Thomsen, Olap Solutions: Building Multidimensional Information Systems, John Wiley & Sons, 1997.
J.D. Ullman, Effcient Implementation of Data Cubes Via Materialized Views A survey of the field for the 1996 KDD conference.
J.D. Ullman, Principles of Database and Knowledge-base Systems, Volume II, Computer Science Press, 1988
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shukla, A., Deshpande, P.M., Naughton, J.F. (2000). Materialized View Selection for Multi-cube Data Models. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds) Advances in Database Technology — EDBT 2000. EDBT 2000. Lecture Notes in Computer Science, vol 1777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46439-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-46439-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67227-2
Online ISBN: 978-3-540-46439-6
eBook Packages: Springer Book Archive