Multi-query optimization for on-line analytical processing

摘要: Multi-dimensional expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of MDX query, given that most data warehouses maintain a set redundant materialized views accelerate operations. A number greedy and approximation algorithms have been proposed different versions problem. In this paper we evaluate experimentally their performance, concluding they do not scale well realistic workloads. Motivated by fact, develop two novel algorithms. Our construct plan in top-down manner identifying each step beneficial view, instead finding promising query. We show extensive experimentation our methods outperform existing ones cases.