Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2661829.2661881acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Pulling Conjunctive Query Equivalence out of the Bag

Published: 03 November 2014 Publication History

Abstract

We present LECQTER, a tool for generating a 'perfect example' database, called exemplar, for a given conjunctive query. Indeed, exemplars separate the given query from any non-equivalent query. Therefore, LECQTER reduces the query equivalence problem to an evaluation of the queries on the exemplar. LECQTER can thus be used for applications ranging from testing coded conjunctive SQL queries to learning how to write sound conjunctive SQL queries, as it provides immediate feedback about the semantic correctness of a query, and not just the correctness of the query answer on some database as, e.g., other SQL tutoring systems. This key novelty of LECQTER relies on the bag semantics of SQL since exemplars do not always exist under set semantics. Detailed experiments show that our construction of exemplars is efficient in practice, and that they can separate a number of non-equivalent user queries that is exponential in the size of the exemplar for the target query. We identify natural parameters to control the time and size of the exemplars constructed. Finally, we offer a solution that overcomes the non-existence of exemplars under set semantics.

References

[1]
K. Bache and M. Lichman. UCI machine learning repository, 2013.
[2]
A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77--90, 1977.
[3]
S. Chaudhuri and M. Y. Vardi. Optimization of real conjunctive queries. In PODS, pages 59--70. ACM, 1993.
[4]
R. Fagin. Horn clauses and database dependencies. J. ACM, 29(4):952--985, 1982.
[5]
Free Software Foundation Inc. SQLTUTOR. http://sqltutor.fsv.cvut.cz/cgi-bin/sqltutor.
[6]
S. Hartmann, M. Kirchberg, and S. Link. Design by example for SQL table definitions with functional dependencies. VLDB J., 21(1):121--144, 2012.
[7]
Y. E. Ioannidis and R. Ramakrishnan. Containment of conjunctive queries: Beyond relations as sets. ACM Trans. Database Syst., 20(3):288--324, 1995.
[8]
T. S. Jayram, P. G. Kolaitis, and E. Vee. The containment problem for REAL conjunctive queries with inequalities. In PODS, pages 80--89, 2006.
[9]
D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167--189, 1984.
[10]
J. Kay, P. Reimann, E. Diebold, and B. Kummerfeld. MOOCs: So many learners, so much potential... IEEE Intelligent Systems, 28(3):70--77, 2013.
[11]
P. G. Kolaitis. The query containment problem: Set semantics vs. bag semantics. In AMW, volume 1087 of CEUR Workshop Proceedings, 2013.
[12]
S. Kopparty and B. Rossman. The homomorphism domination exponent. Eur. J. Comb., 32(7):1097--1114, 2011.
[13]
S. Link. Armstrong databases: Validation, communication and consolidation of conceptual models with perfect test data. In APCCM, pages 3--20, 2012.
[14]
H. Mannila and K.-J. Räihä. Design by example: An application of Armstrong relations. J. Comput. Syst. Sci., 33(2):126--141, 1986.
[15]
H. Mannila and K.-J. Räihä. Test data for relational queries. In PODS, pages 217--223, 1986.
[16]
H. Mannila and K.-J. Räihä. Automatic generation of test data for relational queries. J. Comput. Syst. Sci., 38(2):240--258, 1989.
[17]
M. Orlov. Efficient generation of set partitions. Technical report, University of Ulm, 2002.
[18]
J. D. Ullman. Gradiance on-line accelerated learning. In ACSC, pages 3--6, 2005.

Cited By

View all
  • (2018)Approximation and dependence via multiteam semanticsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-017-9568-483:3-4(297-320)Online publication date: 1-Aug-2018
  • (2016)Approximation and Dependence via Multiteam SemanticsProceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems - Volume 961610.1007/978-3-319-30024-5_15(271-291)Online publication date: 7-Mar-2016

Index Terms

  1. Pulling Conjunctive Query Equivalence out of the Bag

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management
    November 2014
    2152 pages
    ISBN:9781450325981
    DOI:10.1145/2661829
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 November 2014

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. bag semantics
    2. conjunctive query
    3. query equivalence
    4. set semantics
    5. sql
    6. test data

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    CIKM '14
    Sponsor:

    Acceptance Rates

    CIKM '14 Paper Acceptance Rate 175 of 838 submissions, 21%;
    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 11 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Approximation and dependence via multiteam semanticsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-017-9568-483:3-4(297-320)Online publication date: 1-Aug-2018
    • (2016)Approximation and Dependence via Multiteam SemanticsProceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems - Volume 961610.1007/978-3-319-30024-5_15(271-291)Online publication date: 7-Mar-2016

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media