On probabilistic fixpoint and Markov chain query languages

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

Volumn , Issue , 2010, Pages 215-225

  Deutch, Daniel ^a   Koch, Christoph ^b   Milo, Tova ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Markov chains; probabilistic fixpoint

Indexed keywords

APPROXIMATE QUERY EVALUATION; COMPUTATION STEPS; DATALOG; FIXPOINTS; IN-BETWEEN; MARKOV CHAIN; PROBABILISTIC DATABASE; RANDOM WALK;

LINGUISTICS; MARKOV PROCESSES; SEMANTICS;

QUERY LANGUAGES;

EID: 77954729163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807114     Document Type: Conference Paper

References (26)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. U. Nabar, T. Sugihara, and J. Widom. "Trio: A System for Data, Uncertainty, and Lineage". In VLDB, 2006.
3. L. Antova, C. Koch, and D. Olteanu. "From Complete to Incomplete Information and Back". In Proc. SIGMOD, 2007.
4. L. Antova, C. Koch, and D. Olteanu. "Query Language Support for Incomplete Information in the MayBMS System". In Proc. VLDB, 2007.
5. V. Bansal. "Computational Methods for Analyzing Human Genetic Variations". PhD thesis, University of California, San Diego, 2009.
6. O. Benjelloun, A. D. Sarma, C. Hayworth, and J. Widom. "An Introduction to ULDBs and the Trio System". IEEE Data Engineering Bulletin, 2006.
7. D. P. Bertsekas and J. N. Tsitsiklis. Introduction to Probability. MIT Press, 2008.
8. N. Dalvi and D. Suciu. "Efficient query evaluation on probabilistic databases". VLDB Journal, 16(4):523-544, 2007.
9. L. De Raedt, A. Kimmig, and H. Toivonen. "ProbLog: A Probabilistic Prolog and Its Application in Link Discovery". In IJCAI, 2007.
10. D. Freedman. Markov Chains. Springer-Verlag, 1983.
11. N. Fuhr. "Probabilistic Datalog - A Logic For Powerful Retrieval Methods". In Proc. SIGIR, pages 282-290, 1995.
12. M. Goetz and C. Koch. "A Compositional Framework for Complex Queries over Uncertain Data". In Proc. ICDT, 2009.
13. T. J. Green and V. Tannen. "Models for Incomplete and Probabilistic Information". IEEE Data Eng. Bull., 29(1):17-24, 2006.
14. M. Jerrum and A. Sinclair. "The Markov chain Monte Carlo method: an approach to approximate counting and integration". Approximation algorithms for NP-hard problems, 1997.
15. C. Koch. "Approximating Predicates and Expressive Queries on Probabilistic Databases". In Proc. PODS, 2008.
16. C. Koch. "On Query Algebras for Probabilistic Databases". SIGMOD Record, 37(4):78-85, 2008.
17. C. Koch. "A Compositional Query Algebra for Second-Order Logic and Uncertain Databases". In Proc. ICDT, 2009.
18. C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
19. D. Randall. "Mixing (a tutorial on Markov Chains)". In FOCS, 2003.
20. C. Re, N. Dalvi, and D. Suciu. "Efficient Top-k Query Evaluation on Probabilistic Data". In ICDE, 2007.
21. P. Sen and A. Deshpande. "Representing and Querying Correlated Tuples in Probabilistic Databases". In ICDE, 2007.
22. D. Sorensen and D. Gianola. "Likelihood, Bayesian, and MCMC Methods in Quantitative Genetics". Springer-Verlag, New York, July 2002.
23. Stanford Trio Project. "TriQL - The Trio Query Language", 2006.
24. L. Valiant. "The complexity of computing the permanent". Theoretical Computer Science, 8(2):189-201, 1979.
25. M. Y. Vardi. "The Complexity of Relational Query Languages". In Proc. STOC, pages 137-146, 1982.
26. V. V. Vazirani. Approximation Algorithms. Springer, 2004.