skip to main content
10.1145/2463664.2465220acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Learning and verifying quantified boolean queries by example

Published:22 June 2013Publication History

ABSTRACT

To help a user specify and verify quantified queries --- a class of database queries known to be very challenging for all but the most expert users --- one can question the user on whether certain data objects are answers or non-answers to her intended query. In this paper, we analyze the number of questions needed to learn or verify qhorn queries, a special class of Boolean quantified queries whose underlying form is conjunctions of quantified Horn expressions. We provide optimal polynomial-question and polynomial-time learning and verification algorithms for two subclasses of the class qhorn with upper constant limits on a query's causal density.

References

  1. A. Abouzied et al. Learning and verifying quantified boolean queries by example. arXiv.org {cs.DB}.Google ScholarGoogle Scholar
  2. A. Abouzied, J. Hellerstein, and A. Silberschatz. Dataplay: interactive tweaking and example-driven correction of graphical database queries. In UIST, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Angluin. Queries and concept learning. Mach. Learn., 2(4):319--342, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of horn clauses. In COLT, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. J. ACM, 40(1):185--210, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Anthony et al. On exact specification by examples. In COLT, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Das Sarma et al. Synthesizing view definitions from data. In ICDT, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. A. Goldman and M. J. Kearns. On the complexity of teaching. In COLT, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Goldsmith and R. H. Sloan. New horn revision algorithms. J. Mach. Learn. Res., 6:1919--1938, Dec. 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. Haussler. Learning conjunctive concepts in structural domains. Mach. Learn., 4(1):7--40, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. J. Kearns and U. V. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, USA, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Khardon. Learning first order universal horn expressions. In COLT, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Reisner. Use of psychological experimentation as an aid to development of a query language. IEEE Trans. on Soft. Eng., SE-3(3):218--229, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Shinohara and S. Miyano. Teachability in computational learning. New Gen. Comput., 8(4):337--347, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Staworko and P. Wieczorek. Learning twig and path queries. In ICDT, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. ten Cate, V. Dalmau, and P. G. Kolaitis. Learning schema mappings. In ICDT, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Q. T. Tran, C. Chan, and S. Parthasarathy. Query by output. In SIGMOD, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. L. G. Valiant. A theory of the learnable. CACM, 27(11):1134--1142, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Learning and verifying quantified boolean queries by example

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems
        June 2013
        334 pages
        ISBN:9781450320665
        DOI:10.1145/2463664
        • General Chair:
        • Richard Hull,
        • Program Chair:
        • Wenfei Fan

        Copyright © 2013 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 June 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        PODS '13 Paper Acceptance Rate24of97submissions,25%Overall Acceptance Rate476of1,835submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!