Database Paper Browser

Back to papers

Running Tree Automata on Probabilistic XML

Summary: Identify a tractable case for evaluating deterministic bottom-up unranked tree automata on probabilistic XML (distributional-node model): an efficient algorithm when transitions are given by deterministic string automata, enabling sampling and MSO query evaluation under schema conformance. Also analyze complexity of attributes, keys/foreign-keys and extend the model to repeated-sampling nodes that further blow up the possible-world space. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1495
Venue
PODS
Year
2009
Pagerank
5.5802694e-05
Overall Rank
5,296 | 63.16%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
6,284 Probabilistic XML via Markov Chains 2010 VLDB 5.128131e-05
6,997 Tractable Lineages on Treelike Instances: Limits and Extensions 2016 PODS 4.8676446e-05
7,601 Conjunctive Queries on Probabilistic Graphs: Combined Complexity 2017 PODS 4.698961e-05
12,213 Transducing Markov Sequences 2010 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers