Equivalence of nested queries with mixed semantics

Authors:
David DeHaan
Affiliations:
University of Waterloo, Waterloo, ON, Canada
Venue:
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2009

Citing 37
Cited 1

Theoretical foundation of algebraic optimization utilizing unnormalized relations

Proceedings on International conference on database theory
Extending relational algebra and relational calculus with set-valued attributes and aggregate functions

ACM Transactions on Database Systems (TODS)
The Verso algebra or how to answer queries with fewer joins

Journal of Computer and System Sciences
On conjunctive queries containing inequalities

Journal of the ACM (JACM)
Maintaining materialized views without accessing base data

Information Systems
The complexity of querying indefinite data about linearly ordered domains

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimization of real conjunctive queries

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint checking with partial information

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New techniques for studying set languages, bag languages and aggregate functions

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of programming with complex objects and collection types

ICDT '92 Selected papers of the fourth international conference on Database theory
Containment of conjunctive queries: beyond relations as sets

ACM Transactions on Database Systems (TODS)
Answering queries using views (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding containment for queries with complex objects (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of aggregation constraints

Theoretical Computer Science
Magic conditions

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Querying aggregate data

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On optimizing an SQL-like nested query

ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators

Journal of the ACM (JACM)
Answering complex SQL queries using automatic summary tables

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Performing Group-By before Join

Proceedings of the Tenth International Conference on Data Engineering
Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around

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
Answering Queries with Aggregation Using Views

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Reasoning with Aggregation Constraints

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Extending query rewriting techniques for fine-grained access control

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Equivalences among aggregate queries with negation

ACM Transactions on Computational Logic (TOCL)
Algebraic equivalences of nested relational operators

Information Systems
Stacked indexed views in microsoft SQL server

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Equivalence of queries combining set and bag-set semantics

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding equivalences among conjunctive aggregate queries

Journal of the ACM (JACM)
Well-definedness and semantic type-checking for the nested relational calculus

Theoretical Computer Science
Containment of nested XML queries

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Compiling mappings to bridge applications and databases

ACM Transactions on Database Systems (TODS)
Database Systems: The Complete Book

Database Systems: The Complete Book

Equivalence and minimization of conjunctive queries under combined semantics

Proceedings of the 15th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection types. Using an encoding of nested objects as flat relations, we translate the problem to deciding the equivalence between encodings output by relational conjunctive queries. This encoding equivalence cleanly unifies and generalizes previous results for deciding equivalence of conjunctive queries evaluated under various processing semantics. As part of our characterization of encoding equivalence, we define a normal form for encoding queries and contend that this normal form offers new insight into the fundamental principles governing the behaviour of nested aggregation.