Abstract
Query containment and equivalence are fundamental problems in the context of query processing and optimization. In this paper, we consider combined-semantics equivalence of conjunctive (CQ) queries. The combined-semantics formalism [10,11] generalizes the well-known and practically useful notions of set, bag, and bag-set semantics for CQ queries. It also provides tools for studying practical SQL queries, specifically important types of queries arising in on-line analytical processing. In our study, we introduce a containment-based algorithm for deciding combined-semantics equivalence for pairs of CQ queries that belong to a large well-behaved class of “explicit-wave” queries. Our algorithm, as well as our general sufficient condition for containment of combined-semantics CQ queries, generalizes in a uniform way the tests reported in [3,6,11]. Moreover, we single out a subclass of explicit-wave CQ queries for which it is tractable to determine combined-semantics equivalence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
