Abstract
Multi-Dimensional Expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX query, given that most data warehouses maintain a set of redundant materialized views to accelerate OLAP operations. A number of greedy and approximation algorithms have been proposed for different versions of the problem. In this paper we evaluate experimentally their performance using the APB and TPC-H benchmarks, concluding that they do not scale well for realistic workloads. Motivated by this fact, we developed two novel greedy algorithms. Our algorithms construct the execution plan in a top-down manner by identifying in each step the most beneficial view, instead of finding the most promising query. We show by extensive experimentation that our methods outperform the existing ones in most cases
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
Codd E.F., Codd S.B., Salley C.T., “Providing OLAP (on-line analytical processing) to user-analysts: An IT mandate”, Technical report, 1993.
Gupta H., Mumick I.S., “Selection of Views to Materialize Under a Maintenance-Time Constraint”, Proc. ICDT, 1999.
Gupta H., “Selection of Views to Materialize in a Data Warehouse”, Proc. ICDT, 1997.
Harinarayan V., Rajaraman A., Ullman J.D., “Implementing data cubes efficiently”, Proc. ACM-SIGMOD, 1996.
Kalnis P., Papadias D., “Optimization algorithms for simultaneous multidimensional queries in OLAP environments”, Technical report, HKUSTCS00-04, 2000, available at http://www.cs.ust.hk/~kalnis/hkust-cs00-04.pdf.
Kotidis Y., Roussopoulos N., “DynaMat: A Dynamic View Management System for Data Warehouses”, Proc. ACM-SIGMOD, 1999.
Liang W., Orlowska M.E., Yu, J.X., “Optimizing multiple dimensional queries simultaneously in multidimensional databases”, The VLDB Journal, 8, 2000.
Microsoft Corp., “OLE DB for OLAP Design Specification”, http://www.microsoft.com
O’Neil P., Quass D., “Improved query performance with variant indexes”, Proc. ACM-SIGMOD, 1997.
Park J., Segev A., “Using common subexpressions to optimize multiple queries”, Proc. ICDE, 1988.
Roy P., Seshadri S., Sudarshan S., Bhobe S., “Efficient and Extensible Algorithms for Multi Query Optimization#x201D;, Proc. ACM-SIGMOD, 2000.
Sellis T.K., “Multi-query optimization”, ACM Trans. On Database Systems, 13(1), 1988.
Shukla A., Deshpande P., Naughton J.F., “Materialized View Selection for Multidimensional Datasets”, Proc. VLDB, 1998.
Shim K., Sellis T.K., “Improvements on heuristic algorithm for multi-query optimization”, Data and Knowledge Engineering, 12(2), 1994.
Sundaresan P.: “Data warehousing features in Informix Online XPS”, Proc. 4th PDIS, 1996.
Zelikovsky A., “A series of approximation algorithms for the acyclic directed Steiner tree problem”, Algorithmica 18, 1997.
Zhao Y., Deshpande P.M., Naughton J.F., Shukla A., “Simultaneous optimization and evaluation of multiple dimension queries”, Proc. ACM-SIGMOD, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalnis, P., Papadias, D. (2001). Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2001. Lecture Notes in Computer Science, vol 2114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44801-2_26
Download citation
DOI: https://doi.org/10.1007/3-540-44801-2_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42553-3
Online ISBN: 978-3-540-44801-3
eBook Packages: Springer Book Archive