Providing support for full relational algebra in probabilistic databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 315-326

  Fink, Robert ^a   Olteanu, Dan ^a   Rath, Swaroop ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE EVALUATION; DISJUNCTIVE NORMAL FORM; EFFICIENT COMPUTATION; EFFICIENT QUERY EVALUATION; FINITE PROBABILITIES; ITS EFFICIENCIES; LOWER AND UPPER PROBABILITIES; PROBABILISTIC DATABASE; PROBABILITY COMPUTATIONS; RELATIONAL ALGEBRA; RELATIONAL DATABASE;

DATABASE SYSTEMS; PROBABILITY;

ALGEBRA;

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

References (22)

1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theor. Comput. Sci., 78(1), 1991.
2. L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and simple relational processing of uncertain data. In Proc. ICDE, 2008.
3. Braunwald, Isselbacher, Petersdorf, Wilson, Martin, and Fauci. Harri-son's Principles of Internal Medicine. McGraw Hill Book Company, 11th edition, 1987.
4. N. Dalvi, C. Ŕe, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7), 2009.
5. N. Dalvi, K. Schnaitter, and D. Suciu. Computing query probability with incidence algebras. In PODS, 2010.
6. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB Journal, 16(4), 2007.
7. R. Fink and D. Olteanu. On the optimal approximation of queries using tractable propositional theories. In ICDT, 2011.
8. W. Gatterbauer, A. K. Jha, and D. Suciu. Dissociation and propagation for efficient query evaluation over probabilistic databases. Technical Report UW-CSE-10-04-01, U. Washington, 2010.
9. T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of ACM, 31(4), 1984.
10. R. M. Karp, M. Luby, and N. Madras. Monte-carlo approximation algorithms for enumeration problems. J. Algorithms, 10(3), 1989.
11. D. Olteanu and J. Huang. Using obdds for efficient query evaluation on probabilistic databases. In Proc. SUM, 2008.
12. D. Olteanu, J. Huang, and C. Koch. Sprout: Lazy vs. eager query plans for tuple-independent probabilistic databases. In Proc. ICDE, 2009.
13. D. Olteanu, J. Huang, and C. Koch. Approximate confidence computation for probabilistic databases. In Proc. ICDE, 2010.
14. J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput., 12(4), 1983.
15. R. Rantzau. Frequent itemset discovery with sql using universal quantification. In Database Support for Data Mining Applications, 2004.
16. S. Rao, A. Badia, and D. V. Gucht. Providing better support for a class of decision support queries. In SIGMOD, 1996.
17. C. Ŕe, J. Letchner, M. Balazinska, and D. Suciu. Event queries on correlated probabilistic streams. In SIGMOD, 2008.
18. C. Ŕe and D. Suciu. The trichotomy of having queries on a probabilistic database. VLDB J., 18(5), 2009.
19. P. Sen, A. Deshpande, and L. Getoor. Read-once functions and query evaluation in probabilistic databases. In VLDB, 2010.
20. L. Trevisan. A note on deterministic approximate counting for k-dnf. In Proc. APPROX-RANDOM, pages 417-426, 2004. (Pubitemid 39210147)
21. L. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8:410-421, 1979.
22. T.-Y. Wang, C. Ŕe, and D. Suciu. Implementing not exists predicates over a probabilistic database. In QDB/MUD, 2008.