ACM Transactions on Database Systems (TODS)
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
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
Minimizing restricted-fanout queries
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Containment of conjunctive queries: beyond relations as sets
ACM Transactions on Database Systems (TODS)
Semantic query optimization in Datalog programs (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems (TODS)
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Foundations of aggregation constraints
Theoretical Computer Science
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Exact and approximate aggregation in constraint query languages
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Journal of the ACM (JACM)
Tree canonization and transitive closure
Information and Computation
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Equivalences among aggregate queries with negation
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Static analysis in datalog extensions
Journal of the ACM (JACM)
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Processing complex aggregate queries over data streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment of Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Algebraic Properties of Bag Data Types
VLDB '91 Proceedings of the 17th 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
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Expressive Power of Unary Counters
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Logics with Aggregate Operators
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Equivalences among aggregate queries with negation
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 12th International Conference on Database Theory
Equivalence of queries that are sensitive to multiplicities
The VLDB Journal — The International Journal on Very Large Data Bases
Equivalence of nested queries with mixed semantics
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bag equivalence of XPath queries
Proceedings of the 13th International Conference on Database Theory
Database theory: query languages
Algorithms and theory of computation handbook
The impact of virtual views on containment
Proceedings of the VLDB Endowment
Bag equivalence of tree patterns
ACM Transactions on Database Systems (TODS)
Classification of annotation semirings over query containment
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Classification of annotation semirings over containment of conjunctive queries
ACM Transactions on Database Systems (TODS)
Hi-index | 0.01 |
Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators count, count-distinct, min, max, and sum. Essentially, this class contains unnested SQL queries with the above aggregate operators, with a where clause consisting of a conjunction of comparisons, and without a having clause. The comparisons are either interpreted over a domain with a dense order (like the rationals) or with a discrete order (like the integers). Characterizations of equivalence differ for the two cases. For queries with either max or min, equivalence is characterized in terms of dominance mappings, which can be viewed as a generalization of containment mappings. For queries with the count-distinct operator, a sufficient condition for equivalence is given in terms of equivalence of conjunctive queries under set semantics. For some special cases, it is shown that this condition is also necessary. For conjunctive queries with comparisons but without aggregation, equivalence under bag-set semantics is characterized in terms of isomorphism. This characterization essentially remains the same also for queries with the count operator. Moreover, this characterization also applies to queries with the sum operator if the queries have either constants or comparisons, but not both. In the general case (i.e., both comparisons and constants), the characterization of the equivalence of queries with the sum operator is more elaborate. All the characterizations given in the paper are decidable in polynomial space.