Advertisement

Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments

  • Panos Kalnis
  • Dimitris Papadias
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2114)

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CCS93]
    Codd E.F., Codd S.B., Salley C.T., “Providing OLAP (on-line analytical processing) to user-analysts: An IT mandate”, Technical report, 1993.Google Scholar
  2. [GM99]
    Gupta H., Mumick I.S., “Selection of Views to Materialize Under a Maintenance-Time Constraint”, Proc. ICDT, 1999.Google Scholar
  3. [Gupt97]
    Gupta H., “Selection of Views to Materialize in a Data Warehouse”, Proc. ICDT, 1997.Google Scholar
  4. [HRU96]
    Harinarayan V., Rajaraman A., Ullman J.D., “Implementing data cubes efficiently”, Proc. ACM-SIGMOD, 1996.Google Scholar
  5. [KP00]
    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.
  6. [KR99]
    Kotidis Y., Roussopoulos N., “DynaMat: A Dynamic View Management System for Data Warehouses”, Proc. ACM-SIGMOD, 1999.Google Scholar
  7. [LOY00]
    Liang W., Orlowska M.E., Yu, J.X., “Optimizing multiple dimensional queries simultaneously in multidimensional databases”, The VLDB Journal, 8, 2000.Google Scholar
  8. [MS]
    Microsoft Corp., “OLE DB for OLAP Design Specification”, http://www.microsoft.com
  9. [OQ97]
    O’Neil P., Quass D., “Improved query performance with variant indexes”, Proc. ACM-SIGMOD, 1997.Google Scholar
  10. [PS88]
    Park J., Segev A., “Using common subexpressions to optimize multiple queries”, Proc. ICDE, 1988.Google Scholar
  11. [RSSB00]
    Roy P., Seshadri S., Sudarshan S., Bhobe S., “Efficient and Extensible Algorithms for Multi Query Optimization#x201D;, Proc. ACM-SIGMOD, 2000.Google Scholar
  12. [S88]
    Sellis T.K., “Multi-query optimization”, ACM Trans. On Database Systems, 13(1), 1988.Google Scholar
  13. [SDN98]
    Shukla A., Deshpande P., Naughton J.F., “Materialized View Selection for Multidimensional Datasets”, Proc. VLDB, 1998.Google Scholar
  14. [SS94]
    Shim K., Sellis T.K., “Improvements on heuristic algorithm for multi-query optimization”, Data and Knowledge Engineering, 12(2), 1994.Google Scholar
  15. [Su96]
    Sundaresan P.: “Data warehousing features in Informix Online XPS”, Proc. 4th PDIS, 1996.Google Scholar
  16. [Zeli97]
    Zelikovsky A., “A series of approximation algorithms for the acyclic directed Steiner tree problem”, Algorithmica 18, 1997.Google Scholar
  17. [ZDNS98]
    Zhao Y., Deshpande P.M., Naughton J.F., Shukla A., “Simultaneous optimization and evaluation of multiple dimension queries”, Proc. ACM-SIGMOD, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Panos Kalnis
    • 1
  • Dimitris Papadias
    • 1
  1. 1.Department of Computer ScienceHong Kong University of Science and TechnologyClear Water BayHong Kong

Personalised recommendations