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

Computing query probability with incidence algebras

Published:06 June 2010Publication History

ABSTRACT

We describe an algorithm that evaluates queries over probabilistic databases using Mobius' inversion formula in incidence algebras. The queries we consider are unions of conjunctive queries (equivalently: existential, positive First Order sentences), and the probabilistic databases are tuple-independent structures. Our algorithm runs in PTIME on a subset of queries called "safe" queries, and is complete, in the sense that every unsafe query is hard for the class FP#P. The algorithm is very simple and easy to implement in practice, yet it is non-obvious. Mobius' inversion formula, which is in essence inclusion-exclusion, plays a key role for completeness, by allowing the algorithm to compute the probability of some safe queries even when they have some subqueries that are unsafe. We also apply the same lattice-theoretic techniques to analyze an algorithm based on lifted conditioning, and prove that it is incomplete.

References

  1. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Inf. Comput, 125(1):1--12, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Nadia Creignou. A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. Syst. Sci., 51(3):511--522, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Dalvi, K. Schnaitter, and D. Suciu. Computing query probability with incidence algebras. Technical Report UW-CSE-10-03-02, University of Washington, March 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, Toronto, Canada, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, pages 293--302, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. Dalvi and D. Suciu. Management of probabilistic data: Foundations and challenges. In PODS, pages 1--12, Beijing, China, 2007. (invited talk). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Adnan Darwiche. A differential approach to inference in bayesian networks. Journal of the ACM, 50(3):280--305, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Erich Grädel, Yuri Gurevich, and Colin Hirsch. The complexity of query reliability. In PODS, pages 227--234, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Technical Report UW-CSE-10-03-02, University of Washington, March 2010.Google ScholarGoogle Scholar
  10. Dan Olteanu and Jiewen Huang. Secondary-storage confidence computation for conjunctive queries with inequalities. In SIGMOD, pages 389--402, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Dan Olteanu, Jiewen Huang, and Christoph Koch. Sprout: Lazy vs. eager query plans for tuple-independent probabilistic databases. In ICDE, pages 640--651, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Poole. First-order probabilistic inference. In IJCAI, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Yehoushua Sagiv and Mihalis Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27:633--655, 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Sen, A.Deshpande, and L. Getoor. Bisimulation-based approximate lifted inference. In UAI, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Parag Singla and Pedro Domingos. Lifted first-order belief propagation. In AAAI, pages 1094--1099, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Richard P. Stanley. Enumerative Combinatorics. Cambridge University Press, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ingo Wegener. BDDs--design, analysis, complexity, and applications. Discrete Applied Mathematics, 138(1-2):229--251, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Computing query probability with incidence algebras

          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!