Database Paper Browser

Back to papers

Probabilistic XML via Markov Chains

Summary: Recursive Markov Chains define probabilistic XML distributions, unifying and extending prior probabilistic models. RMCs offer exponential succinctness, unbounded probability domains, and tractable fragments that subsume probabilistic DTDs and map expressiveness between formalisms. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10124
Venue
VLDB
Year
2010
Pagerank
5.128131e-05
Overall Rank
6,284 | 56.29%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
571 The Complexity of Query Reliability 1998 PODS 0.00019910719
1,370 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction 2002 PODS 0.00012338027
2,978 Matching Twigs in Probabilistic XML 2007 VLDB 7.7845728e-05
3,398 Event Queries on Correlated Probabilistic Streams 2008 SIGMOD 7.141911e-05
5,296 Running Tree Automata on Probabilistic XML 2009 PODS 5.5802694e-05
Previous Page 1 / 1 Next

Semantically Similar Papers