ACM Transactions on Database Systems (TODS)
Introduction to algorithms
Exploiting inter-operation parallelism in XPRS
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Multiple query optimization with Depth-First Branch-and-Bound and dynamic query ordering
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Workload scheduling for multiple query processing
Information Processing Letters
Scheduling problems in parallel query optimization
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Anatomy of a Mudular Multiple Query Optimizer
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
Redbrick Vista: Aggregate Computation and Management
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Batch data warehouse maintenance in dynamic environments
Proceedings of the eleventh international conference on Information and knowledge management
Demand-Driven Caching in Multiuser Environment
IEEE Transactions on Knowledge and Data Engineering
Dynamic programming solution for multiple query optimization problem
Information Processing Letters
Efficient computation of multiple group by queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
QPipe: a simultaneously pipelined relational query engine
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Optimization of continuous queries with shared expensive filters
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Scalable event matching for overlapping subscriptions in pub/sub systems
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Efficient execution of multiple queries on deep memory hierarchy
Journal of Computer Science and Technology
Coarse-grained optimization: techniques for rewriting SQL statement sequences
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The case for precision sharing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An approach to optimize data processing in business processes
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Cooperative scans: dynamic bandwidth sharing in a DBMS
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Framework for Web service query algebra and optimization
ACM Transactions on the Web (TWEB)
Journal of Systems and Software
Near-optimal algorithms for shared filter evaluation in data stream systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Data integration flows for business intelligence
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
QoX-driven ETL design: reducing the cost of ETL consulting engagements
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Cost-Based Vectorization of Instance-Based Integration Processes
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Supporting views in data stream management systems
ACM Transactions on Database Systems (TODS)
Dynamic programming solution for multiple query optimization problem
Information Processing Letters
Journal of Intelligent Information Systems
SQL queries with CASE expressions
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Adaptive holistic scheduling for query processing in sensor networks
Journal of Parallel and Distributed Computing
Cost-based vectorization of instance-based integration processes
Information Systems
Adaptive optimization for multiple continuous queries
Data & Knowledge Engineering
MiniTasking: improving cache performance for multiple query workloads
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Recursive SQL query optimization with k-iteration lookahead
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
SharedDB: killing one thousand queries with one stone
Proceedings of the VLDB Endowment
Adaptive optimizations of recursive queries in teradata
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
QoS-aware optimization of sensor network queries
The VLDB Journal — The International Journal on Very Large Data Bases
Sharing data and work across concurrent analytical queries
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plans that share common results. Current approaches to multi-query optimization assume that common subexpressions are materialized. Significant performance benefits can be had if common subexpressions are pipelined to their uses, without being materialized. However, plans with pipelining may not always be realizable with limited buffer space, as we show. We present a general model for schedules with pipelining, and present a necessary and sufficient condition for determining validity of a schedule under our model. We show that finding a valid schedule with minimum cost is NP-hard. We present a greedy heuristic for finding good schedules. Finally, we present a performance study that shows the benefit of our algorithms on batches of queries from the TPCD benchmark.