Combined-Semantics Equivalence Is Decidable for a Practical Class of Conjunctive Queries
Rada Chirkova

TL;DR
This paper presents a decidable syntactic criterion for determining combined-semantics equivalence of a broad class of conjunctive queries, covering SQL expressible queries, using containment analysis.
Contribution
It introduces a necessary and sufficient syntactic condition for equivalence of explicit-wave CQ queries, enabling decidability for this large natural language of queries.
Findings
Decidability of combined-semantics equivalence for explicit-wave CQ queries.
A syntactic criterion for query containment and equivalence.
Reduction of the problem to special cases like set, bag, and bag-set semantics.
Abstract
In this paper, we focus on the problem of determining whether two conjunctive ("CQ") queries posed on relational data are combined-semantics equivalent [9]. We continue the tradition of [2,5,9] of studying this problem using the tool of containment between queries. We introduce a syntactic necessary and sufficient condition for equivalence of queries belonging to a large natural language of "explicit-wave" combined-semantics CQ queries; this language encompasses (but is not limited to) all set, bag, and bag-set queries, and appears to cover all combined-semantics CQ queries that are expressible in SQL. Our result solves in the positive the decidability problem of determining combined-semantics equivalence for pairs of explicit-wave CQ queries. That is, for an arbitrary pair of combined-semantics CQ queries, it is decidable (i) to determine whether each of the queries is explicit wave,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Semantic Web and Ontologies
