Probabilistic XML via Markov chains

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 770-781

  Benedikt, Michael ^a   Kharlamov, Evgeny ^b   Olteanu, Dan ^a   Senellart, Pierre ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^c INSTITUT TELECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; MARKOV PROCESSES; XML;

PROBABILISTIC DISTRIBUTION; PROBABILISTIC XML; RECURSIVE MARKOV CHAINS; XML SCHEMA LANGUAGES;

PROBABILITY DISTRIBUTIONS;

EID: 78650112351     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920939     Document Type: Article

References (23)

1. S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart. On the expressiveness of probabilistic XML models. VLDB Journal, 18(5), 2009.
2. S. P. Abney, D. A. McAllester, and F. Pereira. Relating probabilistic grammars and automata. In ACL, 1999.
3. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. W. Reps, and M. Yannakakis. Analysis of recursive state machines. TOPLAS, 27(4), 2005.
4. 106 worlds and beyond: Efficient representation and processing of incomplete information". VLDB Journal, 18(5), 2009.
5. M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. JACM, 55(2), 2008.
6. S. Cohen and B. Kimelfeld. Querying parse trees of stochastic context-free grammars. In ICDT, 2010.
7. S. Cohen, B. Kimelfeld, and Y. Sagiv. Running tree automata on probabilistic XML. In PODS, 2009.
8. J. Esparza, A. Kucera, and R. Mayr. Model checking probabilistic pushdown automata. In LICS, 2004.
9. K. Etessami, D. Wojtczak, and M. Yannakakis. Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems. Technical Report 1249, U. Edinburgh, 2008.
10. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic state machines. In TACAS, 2005.
11. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. JACM, 56(1), 2009.
12. M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees. In LICS, 2003.
13. O. Gauwin, J. Niehren, and Y. Roos. Streaming tree automata. Inf. Process. Lett., 109(1), 2008.
14. G. Gottlob and C. Koch. Monadic Datalog and the expressive power of Web information extraction languages. JACM, 51(1), 2004.
15. E. Grädel, Y. Gurevich, and C. Hirsch. The complexity of query reliability. In PODS, 1998.
16. B. Kimelfeld, Y. Kosharovsky, and Y. Sagiv. Query evaluation over probabilistic XML. VLDB Journal, 18(5), 2009.
17. B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic XML. In VLDB, 2007.
18. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
19. M. Marx. Semantic characterizations of navigational XPath. SIGMOD Record, 34, 2005.
20. S. Petrov, L. Barrett, R. Thibaux, and D. Klein. Learning accurate, compact, and interpretable tree annotation. In ACL, 2006.
21. C. Ré, J. Letchner, M. Balazinska, and D. Suciu. Event queries on correlated probabilistic streams. In SIGMOD, 2008.
22. L. Stockmeyer. The Complexity of Decision Problems in Automata and Logic. PhD thesis, MIT, 1974.
23. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Springer-Verlag, 1997.