Please use this identifier to cite or link to this item:

Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments

Authors Kalnis, Panos HKUST affiliated (currently or previously)
Papadias, Dimitris View this author's profile
Issue Date 2001
Source Proceedings of the 3rd International Conference on Data Warehousing and Knowledge Discovery, 5-7 September, Munich , 264-273
Summary 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.
Rights The original publication is available at Please use the appropriate URL and/or DOI for the article.
Language English
Format Conference paper
Files in this item:
File Description Size Format
papadias14.pdf 105297 B Adobe PDF