Optimization of nested SQL queries revisited
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
An improved division operator for relational algebra
Information Systems
A Relational Calculus with Set Operators, Its Safety, and Equivalent Graphical Languages
IEEE Transactions on Software Engineering
Technique for universal quantification in SQL
ACM SIGMOD Record
Fast algorithms for universal quantification in large databases
ACM Transactions on Database Systems (TODS)
Providing better support for a class of decision support queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Outerjoin simplification and reordering for query optimization
ACM Transactions on Database Systems (TODS)
Orthogonal optimization of subqueries and aggregation
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Improving SQL with Generalized Quantifiers
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
The MD-join: An Operator for Complex OLAP
Proceedings of the 17th International Conference on Data Engineering
Set Containment Joins: The Good, The Bad and The Ugly
VLDB '00 Proceedings of the 26th 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
Efficient processing of joins on set-valued attributes
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
Nested Queries and Quantifiers in an Ordered Context
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Canonical abstraction for outerjoin optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On the complexity of division and set joins in the relational algebra
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 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
Laws for Rewriting Queries Containing Division Operators
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient exploitation of similar subexpressions for query processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
We present research aimed at improving our understanding of the use and implementation of quantification in relational query languages in general and SQL in particular. In order to make our results as general as possible, we use the framework of Generalized Quantification. Generalized Quantifiers (GQs) are high-level, declarative logical operators that in the past have been studied from a theoretical perspective. In this paper we focus on their practical use, showing how to incorporate a dynamic set of GQs in relational query languages, how to implement them efficiently and use them in the context of SQL. We present experimental evidence of the performance of the approach, showing that it improves over traditional (relational) approaches.