Access path selection in a relational database management system
Readings in database systems
Dynamic query evaluation plans
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Index scans using a finite LRU buffer: a validated I/O model
ACM Transactions on Database Systems (TODS)
Introduction to algorithms
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Measuring the complexity of join enumeration in query optimization
Proceedings of the sixteenth international conference on Very large databases
Efficient assembly for complex objects
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
On the propagation of errors in the size of join results
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Query optimization for parallel execution
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
On the performance of object clustering techniques
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Query processing in the ObjectStore database system
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Design and implementation of the glue-nail database system
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Experiences building the open OODB query optimizer
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Optimization of parallel query execution plans in XPRS
Distributed and Parallel Databases - Selected papers from the first international conference on parallel and distributed information systems
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Correcting execution of distributed queries
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Support for repetitive transactions and ad hoc queries in System R
ACM Transactions on Database Systems (TODS)
Dynamic Query Optimization in Rdb/VMS
Proceedings of the Ninth International Conference on Data Engineering
Algebraic Optimization of Computations over Scientific Databases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
Dynamic resource brokering for multi-user query execution
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient mid-query re-optimization of sub-optimal query execution plans
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Cost-based query scrambling for initial delays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Memory-adaptive scheduling for large query execution
Proceedings of the seventh international conference on Information and knowledge management
Dynamic Query Operator Scheduling for Wide-Area Remote Access
Distributed and Parallel Databases
Least expected cost query optimization: an exercise in utility
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An adaptive query execution system for data integration
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Plan-Per-Tuple Optimization Solution - Parallel Execution of Expensive User-Defined Functions
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Design and Analysis of Parametric Query Optimization Algorithms
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
User-Optimizer Communication using Abstract Plans in Sybase ASE
Proceedings of the 27th International Conference on Very Large Data Bases
The Fittest Survives: An Adaptive Approach to Query Optimization
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Processing Object-Oriented Queries with Invertible Late Bound Functions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Reordering Query Execution in Tertiary Memory Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
MIL primitives for querying a fragmented world
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
A characterization of the sensitivity of query optimization to storage access cost parameters
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Distributed query adaptation and its trade-offs
Proceedings of the 2003 ACM symposium on Applied computing
Adapting to source properties in processing data integration queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Dynamic plan migration for continuous queries over data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Toward a progress indicator for database queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Exploiting Correlated Attributes in Acquisitional Query Processing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Increasing the Accuracy and Coverage of SQL Progress Indicators
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Analyzing plan diagrams of database query optimizers
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Integrating databases and workflow systems
ACM SIGMOD Record
Data integration: the teenage years
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Resource control for java database extensions
COOTS'99 Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5
Parametric query optimization for linear and piecewise linear cost functions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Plan selection based on query clustering
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
AniPQO: almost non-intrusive parametric query optimization for nonlinear cost functions
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the production of anorexic plan diagrams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Foundations and Trends in Databases
A strategy to develop adaptive and interactive query brokers
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Efficiently approximating query optimizer plan diagrams
Proceedings of the VLDB Endowment
Optimizer plan change management: improved stability and performance in Oracle 11g
Proceedings of the VLDB Endowment
Closing the query processing loop in Oracle 11g
Proceedings of the VLDB Endowment
ROX: run-time optimization of XQueries
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Dynamic plan generation for parameterized queries
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Query optimizers: time to rethink the contract?
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Evolution of Query Optimization Methods: From Centralized Database Systems to Data Grid Systems
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Adaptive join processing in pipelined plans
Proceedings of the 13th International Conference on Extending Database Technology
Teddies: trained Eddies for reactive stream processing
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Dynamic query optimisation: towards decentralised methods
International Journal of Intelligent Information and Database Systems
Cluster-and-conquer: hierarchical multi-metric query processing in large-scale database federations
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Scalable information extraction for web queries
International Journal of Computational Science and Engineering
New algorithms for join and grouping operations
Computer Science - Research and Development
Optimizing adaptive multi-route query processing via time-partitioned indices
Journal of Computer and System Sciences
Continuous cloud-scale query optimization and processing
Proceedings of the VLDB Endowment
Exploring optimization and caching for efficient collection operations
Automated Software Engineering
Hi-index | 0.00 |
Traditional query optimizers assume accurate knowledge of run-time parameters such as selectivities and resource availability during plan optimization, i.e., at compile time. In reality, however, this assumption is often not justified. Therefore, the “static” plans produced by traditional optimizers may not be optimal for many of their actual run-time invocations. Instead, we propose a novel optimization model that assigns the bulk of the optimization effort to compile-time and delays carefully selected optimization decisions until run-time. Our previous work defined the run-time primitives, “dynamic plans” using “choose-plan” operators, for executing such delayed decisions, but did not solve the problem of constructing dynamic plans at compile-time. The present paper introduces techniques that solve this problem. Experience with a working prototype optimizer demonstrates (i) that the additional optimization and start-up overhead of dynamic plans compared to static plans is dominated by their advantage at run-time, (ii) that dynamic plans are as robust as the “brute-force” remedy of run-time optimization, i.e., dynamic plans maintain their optimality even if parameters change between compile-time and run-time, and (iii) that the start-up overhead of dynamic plans is significantly less than the time required for complete optimization at run-time. In other words, our proposed techniques are superior to both techniques considered to-date, namely compile-time optimization into a single static plan as well as run-time optimization. Finally, we believe that the concepts and technology described can be transferred to commercial query optimizers in order to improve the performance of embedded queries with host variables in the query predicate and to adapt to run-time system loads unpredictable at compile time.