Read-once functions and query evaluation in probabilistic databases

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 1068-1079

  Sen, Prithviraj ^a   Deshpande, Amol ^b   Getoor, Lise ^b  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; DATABASE SYSTEMS; FACTORIZATION; INFERENCE ENGINES; QUERY LANGUAGES;

COMPUTATIONAL CHALLENGES; DISJUNCTIVE NORMAL FORM; EFFICIENT QUERY EVALUATION; FACTORIZATION ALGORITHMS; HIERARCHICAL QUERIES; MARGINAL PROBABILITY; PROBABILISTIC DATABASE; UNCERTAINTY MANAGEMENT;

QUERY PROCESSING;

EID: 79960025485     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920975     Document Type: Article

References (28)

1. C. C. Aggarwal. Managing and Mining Uncertain Data. Springer, 2009.
2. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. In BIT, 1985.
3. O. Benjelloun, A. Das Sarma, A. Halevy, and J. Widom. ULDBs: Databases with uncertainty and lineage. In VLDB, 2006.
4. J. Boulos, N. Dalvi, B. Mandhani, C. Re, S. Mathur, and D. Suciu. Mystiq: A system for finding more answers by using probabilities. In SIGMOD, 2005.
5. A. Bretscher, D. Corneil, M. Habib, and C. Paul. A simple linear time lexbfs cograph recognition algorithm. SIAM Journal on Discrete Mathematics, 2008.
6. D. Corneil, H. Lerchs, and L. Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 1981.
7. D. Corneil, Y. Perl, and L. Stewart. A linear recognition algorithm for cographs. SIAM Journal of Computing, 1985.
8. N. Dalvi, K. Schnaitter, and D. Suciu. Computing query probability with incidence algebras. In PODS, 2010.
9. N. Dalvi and D. Suciu. Efficient query eval. on prob. databases. In VLDB, '04.
10. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In PODS, 2007.
11. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, 2007.
12. A. Darwiche. A logical approach to factoring belief networks. In Intl. Conf. on Principles and Know. Rep. and Reasoning, 2002.
13. N. Fuhr and T. Rolleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. on Info. Systems, 1997.
14. V. Giakoumakis, F. Roussel, and H. Thuillier. On P4-tidy graphs. Discrete Maths and Theoretical Comp. Science, 1997.
15. M. Golumbic, A. Mintz, and U. Rotics. Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. Discrete Applied Mathematics, 2006.
16. M. Habib and C. Paul. A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics, 2005.
17. J. Hayes. Fanout structure of switching functions. JACM, 1975.
18. R. Jampani, F. Xu, M. Wu, L. L. Perez, C. M. Jermaine, and P. J. Haas. MCDB: A monte carlo approach to managing uncertain data. In SIGMOD, 2008.
19. A. Jha, D. Suciu, and D. Olteanu. Bridging the gap between intensional and extensional query evaluation in probabilistic databases. In EDBT, 2010.
20. T. Jiang, L. Wang, and K. Zhang. Alignment of trees - an alternative to tree edit. In Annual Symposium on Combinatorial Pattern Matching, 1994.
21. C. Koch. Approximating predicates and expressive queries on probabilistic databases. In PODS, 2008.
22. D. Olteanu and J. Huang. Using OBDDs for efficient query evaluation on probabilistic databases. In SUM, 2008.
23. D. Olteanu and J. Huang. Secondary-storage conf. computation for conjunctive queries with inequalities. In SIGMOD, 2009.
24. D. Olteanu, J. Huang, and C. Koch. SPROUT: Lazy vs. eager query plans for tuple-independent probabilistic databases. In ICDE, 2009.
25. D. Olteanu, J. Huang, and C. Koch. Approximate confidence computation in probabilistic databases. In ICDE, 2010.
26. C. Ré and D. Suciu. The trichotomy of having queries on a probabilistic database. VLDB J., 18(5):1091-1116, 2009.
27. P. Sen, A. Deshpande, and L. Getoor. Prdb: managing and exploiting rich correlations in probabilistic databases. VLDB J., 18(5):1065-1090, 2009.
28. TPC-H Benchmark. http://www.tpc.org/.