ACM Transactions on Database Systems (TODS)
Improvements on a heuristic algorithm for multiple-query optimization
Data & Knowledge Engineering
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data warehousing features in Informix OnLine XPS
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Using Common Subexpressions to Optimize Multiple Queries
Proceedings of the Fourth International Conference on Data Engineering
Efficient Organization of Large Multidimensional Arrays
Proceedings of the Tenth International Conference on Data Engineering
Including Group-By in Query Optimization
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Eager Aggregation and Lazy Aggregation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Querying Multiple Features of Groups in Relational Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Compressed data cubes for OLAP aggregate query approximation on continuous dimensions
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the eighth international conference on Information and knowledge management
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A case for dynamic view management
ACM Transactions on Database Systems (TODS)
How to evaluate multiple range-sum queries progressively
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the problem of generating common predecessors
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Using Fuzzy Linguistic Representations to Provide Explanatory Semantics for Data Warehouses
IEEE Transactions on Knowledge and Data Engineering
Improving Performance of Multiple Sequence Alignment Analysis in Multi-Client Environments
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Efficient Constraint-Based Exploratory Mining on Large Data Cubes
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Optimizing multiple dimensional queries simultaneously in multidimensional databases
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting early sorting and early partitioning for decision support query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Concise descriptions of subsets of structured sets
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Multi-query optimization for on-line analytical processing
Information Systems
Pipelining in multi-query optimization
Journal of Computer and System Sciences - Special issu on PODS 2001
Decision support queries on a tape-resident data warehouse
Information Systems
Concise descriptions of subsets of structured sets
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Multiple query optimization in middleware using query teamwork
Software—Practice & Experience
A framework to support multiple query optimization for complex mining tasks
MDM '05 Proceedings of the 6th international workshop on Multimedia data mining: mining integrated media and complex data
Efficient detection of empty-result queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Optimizing complex queries with multiple relation instances
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Plot Query Processing with Wavelets
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Transaction reordering with application to synchronized scans
Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
Peta-scale data warehousing at Yahoo!
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Data & Knowledge Engineering
Multiple query scheduling for distributed semantic caches
Journal of Parallel and Distributed Computing
PolicyReplay: misconfiguration-response queries for data breach reporting
Proceedings of the VLDB Endowment
Distributed and Parallel Databases
Hi-index | 0.00 |
Database researchers have made significant progress on several research issues related to multidimensional data analysis, including the development of fast cubing algorithms, efficient schemes for creating and maintaining precomputed group-bys, and the design of efficient storage structures for multidimensional data. However, to date there has been little or no work on multidimensional query optimization. Recently, Microsoft has proposed “OLE DB for OLAP” as a standard multidimensional interface for databases. OLE DB for OLAP defines Multi-Dimensional Expressions (MDX), which have the interesting and challenging feature of allowing clients to ask several related dimensional queries in a single MDX expression. In this paper, we present three algorithms to optimize multiple related dimensional queries. Two of the algorithms focus on how to generate a global plan from several related local plans. The third algorithm focuses on generating a good global plan without first generating local plans. We also present three new query evaluation primitives that allow related query plans to share portions of their evaluation. Our initial performance results suggest that the exploitation of common subtask evaluation and global optimization can yield substantial performance improvements when relational database systems are used as data sources for multidimensional analysis.