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

On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases

Published:06 June 2010Publication History

ABSTRACT

A natural way for capturing uncertainty in the relational data model is by having relations that violate their primary key constraint, that is, relations in which distinct tuples agree on the primary key. A repair (or possible world) of a database is then obtained by selecting a maximal number of tuples without ever selecting two distinct tuples that have the same primary key value. For a Boolean query q, CERTAINTY(q) is the problem that takes as input a database db and asks whether q evaluates to true on every repair of db. We are interested in determining queries q for which CERTAINTY(q) is first-order expressible (and hence in the low complexity class AC0).

For queries q in the class of conjunctive queries without self-join, we provide a necessary syntactic condition for first-order expressibility of CERTAINTY(q). For acyclic queries, this necessary condition is also a sufficient condition. So we obtain a decision procedure for first-order expressibility of CERTAINTY(q) when q is acyclic and without self-join. We also show that if CERTAINTY(q) is first-order expressible, its first-order definition, commonly called (certain) first-order rewriting, can be constructed in a rather straightforward way.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In L. Liu, A. Reuter, K.-Y. Whang, and J. Zhang, editors, ICDE, page 30. IEEE Computer Society, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68--79. ACM Press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479--513, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Chomicki and J. Marcinkowski. Minimal change integrity maintenance using tuple deletions. Inf. Comput., 197(1-2):90--121, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. N. Dalvi, C. Re, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7):86--94, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4):523--544, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Fuxman, E. Fazli, and R. J. Miller. Conquer: Efficient management of inconsistent databases. In F. Ozcan, editor, SIGMOD Conference, pages 155--166. ACM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci., 73(4):610--635, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579--627, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. L. Grieco, D. Lembo, R. Rosati, and M. Ruzzi. Consistent query answering under key and exclusion dependencies: algorithms and experiments. In O. Herzog, H.-J. Schek, N. Fuhr, A. Chowdhury, and W. Teiken, editors, CIKM, pages 792--799. ACM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Huang, L. Antova, C. Koch, and D. Olteanu. Maybms: a probabilistic database management system. In U. Cetintemel, S. B. Zdonik, D. Kossmann, and N. Tatbul, editors, SIGMOD Conference, pages 1071--1074. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Lembo, R. Rosati, and M. Ruzzi. On the first-order reducibility of unions of conjunctive queries over inconsistent databases. In T. Grust, H. Hopfner, A. Illarramendi, S. Jablonski, M. Mesiti, S. Muller, P.-L. Patranjan, K.-U. Sattler, M. Spiliopoulou, and J. Wijsen, editors, EDBT Workshops, volume 4254 of Lecture Notes in Computer Science, pages 358--374. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. L. Libkin. Elements of Finite Model Theory. Springer, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Maier. The Theory of Relational Databases. Computer Science Press, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Wijsen. On the consistent rewriting of conjunctive queries under primary key constraints. In M. Arenas and M. I. Schwartzbach, editors, DBPL, volume 4797 of Lecture Notes in Computer Science, pages 112--126. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Wijsen. Consistent query answering under primary keys: a characterization of tractable queries. In R. Fagin, editor, ICDT, volume 361 of ACM International Conference Proceeding Series, pages 42--52. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Wijsen. On the consistent rewriting of conjunctive queries under primary key constraints. Inf. Syst., 34(7):578--601, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases

      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 '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
        June 2010
        350 pages
        ISBN:9781450300339
        DOI:10.1145/1807085

        Copyright © 2010 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 6 June 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        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!