Approximate confidence computation in probabilistic databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 145-156

  Olteanu, Dan ^a   Huang, Jiewen ^a   Koch, Christoph ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION TECHNIQUES; CONFIDENCE VALUES; CONJUNCTIVE QUERIES; DECISION DIAGRAM; DETERMINISTIC APPROXIMATION; DISCRETE PROBABILITY DISTRIBUTION; DISCRETE RANDOM VARIABLES; EXACT COMPUTATIONS; INCREMENTAL COMPILATION; INPUT SIZE; LOWER AND UPPER BOUNDS; ORDERS OF MAGNITUDE; PROBABILISTIC DATABASE; PROPOSITIONAL FORMULAS; QUERY ENGINES; RELATIONAL ALGEBRA; SHANNON EXPANSION; TIME POLYNOMIALS;

APPROXIMATION ALGORITHMS; DATABASE SYSTEMS; RANDOM VARIABLES;

PROBABILITY DISTRIBUTIONS;

EID: 77952753360     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447826     Document Type: Conference Paper

References (28)

1. V. Akman. "Implementation of Karp-Luby Monte Carlo method: an exercise in approximate counting". The Computer Journal, 34(3):279-282, 1991.
2. L. Antova, T. Jansen, C. Koch, and D. Olteanu. "Fast and Simple Relational Processing of Uncertain Data". In Proc. ICDE, 2008.
3. O. Benjelloun, A. D. Sarma, C. Hayworth, and J. Widom. "An Introduction to ULDBs and the Trio System". IEEE Data Engineering Bulletin, 2006.
4. E. Birnbaum and E. Lozinskii. "The Good Old Davis-Putnam Procedure Helps Counting Models". Journal of AI Research, 10(6):457-477, 1999.
5. R. K. Brayton. "Factoring logic functions". IBM J. Res. Develop., 31, 1987.
6. P. Dagum, R. M. Karp, M. Luby, and S. M. Ross. "An Optimal Algorithm for Monte Carlo Estimation". SIAM J. Comput., 29(5):1484-1496, 2000. (Pubitemid 33768936)
7. N. Dalvi and D. Suciu. "Efficient Query Evaluation on Probabilistic Databases". VLDB Journal, 16(4), 2007.
8. A. Darwiche and P. Marquis. "A knowlege compilation map". Journal of AI Research, 17:229-264, 2002.
9. M. Davis and H. Putnam. "A Computing Procedure for Quantification Theory". Journal of ACM, 7(3):201-215, 1960.
10. M. Golumbic, A. Mintza, and U. Rotics. "Read-Once Functions Revisited and the Readability Number of a Boolean Function". In Proc. Int. Colloq. on Graph Theory, 2005.
11. C. P. Gomes, A. Sabharwal, and B. Selman. Handbook of Satisfiability, chapter Model Counting. IOS Press, 2009.
12. E. Grädel, Y. Gurevich, and C. Hirsch. "The Complexity of Query Reliability". In Proc. PODS, pages 227-234, 1998.
13. 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 Proc. SIGMOD, 2008.
14. R. M. Karp and M. Luby. "Monte-Carlo Algorithms for Enumeration and Reliability Problems". In Proc. FOCS, pages 56-64, 1983.
15. R. M. Karp, M. Luby, and N. Madras. "Monte-Carlo Approximation Algorithms for Enumeration Problems". J. Algorithms, 10(3):429-448, 1989.
16. C. Koch. "Approximating Predicates and Expressive Queries on Probabilistic Databases". In Proc. PODS, 2008.
17. C. Koch and D. Olteanu. "Conditioning Probabilistic Databases". PVLDB, 1(1), 2008.
18. J. Li and A. Deshpande. "Consensus Answers for Queries over Probabilistic Databases". In Proc. PODS, 2009.
19. D. Olteanu and J. Huang. "Using OBDDs for Efficient Query Evaluation on Probabilistic Databases". In Proc. SUM, 2008.
20. D. Olteanu and J. Huang. "Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities". In Proc. SIGMOD, 2009.
21. D. Olteanu, J. Huang, and C. Koch. "SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases". In Proc. ICDE, 2009.
22. D. Olteanu, C. Koch, and L. Antova. "World-set Decompositions: Expressiveness and Efficient Algorithms". Theoretical Computer Science, 403(2-3), 2008.
23. C. Ré, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In Proc. ICDE, 2007.
24. L. Trevisan. "A Note on Deterministic Approximate Counting for k-DNF". In Proc. APPROX-RANDOM, pages 417-426, 2004.
25. L. Valiant. "The Complexity of Enumeration and Reliability Problems". SIAM J. Comput., 8:410-421, 1979.
26. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
27. W. Wei and B. Selman. "A New Approach to Model Counting". In Proc. SAT, 2005.
28. W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.