Computing query probability with incidence algebras

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2010, Pages 203-214

  Dalvi, Nilesh ^a   Schnaitter, Karl ^b   Suciu, Dan ^c  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

incidence algebra; mobius inversion; probabilistic database

Indexed keywords

CONJUNCTIVE QUERIES; FIRST ORDER SENTENCES; INCIDENCE ALGEBRA; INCLUSION-EXCLUSION; INVERSION FORMULA; MOBIUS INVERSION; PROBABILISTIC DATABASE; SUB-QUERIES;

ALGEBRA; ALGORITHMS;

DATABASE SYSTEMS;

EID: 77954744994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807113     Document Type: Conference Paper

References (17)

1. 1] N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Inf. Comput, 125(1):1-12, 1996. (Pubitemid 126411848)
2. Nadia Creignou. A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. Syst. Sci., 51(3):511-522, 1995.
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.
4. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, Toronto, Canada, 2004.
5. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, pages 293-302, 2007.
6. N. Dalvi and D. Suciu. Management of probabilistic data: Foundations and challenges. In PODS, pages 1-12, Beijing, China, 2007. (invited talk).
7. Adnan Darwiche. A differential approach to inference in bayesian networks. Journal of the ACM, 50(3):280-305, 2003.
8. Erich Grädel, Yuri Gurevich, and Colin Hirsch. The complexity of query reliability. In PODS, pages 227-234, 1998.
9. Kevin H. Knuth. Lattice duality: The origin of probability and entropy. Neurocomputing, 67:245-274, 2005.
10. Dan Olteanu and Jiewen Huang. Secondary-storage confidence computation for conjunctive queries with inequalities. In SIGMOD, pages 389-402, 2009.
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.
12. D. Poole. First-order probabilistic inference. In IJCAI, 2003.
13. Yehoushua Sagiv and Mihalis Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27:633-655, 1980.
14. P. Sen, A.Deshpande, and L. Getoor. Bisimulation-based approximate lifted inference. In UAI, 2009.
15. Parag Singla and Pedro Domingos. Lifted first-order belief propagation. In AAAI, pages 1094-1099, 2008.
16. Richard P. Stanley. Enumerative Combinatorics. Cambridge University Press, 1997.
17. Ingo Wegener. BDDs-design, analysis, complexity, and applications. Discrete Applied Mathematics, 138(1-2):229-251, 2004.