An object-oriented query algebras
Proceedings of the second international workshop on Database programming languages
Extensible/rule based query rewrite optimization in Starburst
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
A general framework for the optimization of object-oriented queries
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Understanding the new SQL: a complete guide
Understanding the new SQL: a complete guide
Outerjoin simplification and reordering for query optimization
ACM Transactions on Database Systems (TODS)
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Subquery Elimination: A Complete Unnesting Algorithm for an Extended Relational Algebra
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Groupwise Processing of Relational Queries
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Including Group-By in Query Optimization
VLDB '94 Proceedings of the 20th 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
The AQUA Data Model and Algebra
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
Why and how to benchmark XML databases
ACM SIGMOD Record
On relational support for XML publishing: beyond sorting and tagging
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
WinMagic: subquery elimination using window aggregation
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Parallel SQL execution in Oracle 10g
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A nested relational approach to processing SQL subqueries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Optimizing nested queries with parameter sort orders
VLDB '05 Proceedings of the 31st international conference on Very large data bases
XQuery implementation in a relational database system
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimization of query streams using semantic prefetching
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Rewriting queries with arbitrary aggregation functions using views
ACM Transactions on Database Systems (TODS)
User-defined aggregate functions: bridging theory and practice
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Strategies for query unnesting in XML databases
ACM Transactions on Database Systems (TODS)
Partitioned optimization of complex queries
Information Systems
Using grouping variables to express complex decision support queries
Data & Knowledge Engineering
SQL query optimization through nested relational algebra
ACM Transactions on Database Systems (TODS)
Processing star queries on hierarchically-clustered fact tables
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Primitives for workload summarization and implications for SQL
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
PIVOT and UNPIVOT: optimization and execution strategies in an RDBMS
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic programming strikes back
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Rewriting procedures for batched bindings
Proceedings of the VLDB Endowment
Recursion in XQuery: put your distributivity safety belt on
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Parallelizing extensible query optimizers
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Ordering, distinctness, aggregation, partitioning and DQP optimization in sybase ASE 15
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Exploiting maximal redundancy to optimize SQL queries
Knowledge and Information Systems
Streams on wires: a query compiler for FPGAs
Proceedings of the VLDB Endowment
θ-Constrained multi-dimensional aggregation
Information Systems
Supporting real-time supply chain decisions based on RFID data streams
Journal of Systems and Software
Efficient auditing for complex SQL queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Another example of a data warehouse system based on transposed files
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Kappa-join: efficient execution of existential quantification in XML query languages
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Dynamic plan migration for snapshot-equivalent continuous queries in data stream systems
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
On the correct and complete enumeration of the core search space
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient implementation of generalized quantification in relational query languages
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
There is considerable overlap between strategies proposed for subquery evaluation, and those for grouping and aggregation. In this paper we show how a number of small, independent primitives generate a rich set of efficient execution strategies —covering standard proposals for subquery evaluation suggested in earlier literature. These small primitives fall into two main, orthogonal areas: Correlation removal, and efficient processing of outerjoins and GroupBy. An optimization approach based on these pieces provides syntax-independence of query processing with respect to subqueries, i. e. equivalent queries written with or without subquery produce the same efficient plan.We describe techniques implemented in Microsoft SQL Server (releases 7.0 and 8.0) for queries containing sub-queries and/or aggregations, based on a number of orthogonal optimizations. We concentrate separately on removing correlated subqueries, also called “query flattening,” and on efficient execution of queries with aggregations. The end result is a modular, flexible implementation, which produces very efficient execution plans. To demonstrate the validity of our approach, we present results for some queries from the TPC-H benchmark. From all published TPC-H results in the 300GB scale, at the time of writing (November 2000), SQL Server has the fastest results on those queries, even on a fraction of the processors used by other systems.