Query Efficiency in Probabilistic XML Models

Summary: Unifies probabilistic XML via p-documents with distributional nodes; analyzes twig queries under value- and object-based semantics. Efficient evaluator for a single tractable family; translations across families and approximate methods for the rest. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4088
Venue: SIGMOD
Year: 2008
Pagerank: 5.7400564e-05
Overall Rank: 6,917 | 52.55%
DOI: 10.1145/1376616.1376687

Incoming Non-self Citations Over Time

Authors

1. Benny Kimelfeld (Hebrew University)
2. Yuri Kosharovsky (Hebrew University)
3. Yehoshua Sagiv (Hebrew University)

BibTeX Citation

@inproceedings{kimelfeld_sigmod08,
        title = {{Query Efficiency in Probabilistic XML Models}},
        author = {Kimelfeld, Benny and Kosharovsky, Yuri and Sagiv, Yehoshua},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376687},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376687},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,853	Efficient Subgraph Search over Large Uncertain Graphs	2011	VLDB	6.4780097e-05
5,168	How to Build Templates for RDF Question/Answering —An Uncertain Graph Similarity Join Approach	2015	SIGMOD	6.3353772e-05
5,346	Running Tree Automata on Probabilistic XML	2009	PODS	6.257995e-05
8,761	Incorporating Constraints in Probabilistic XML	2008	PODS	5.3766157e-05
12,408	Transducing Markov Sequences	2010	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
50	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB	0.00043596705
175	Holistic Twig Joins: Optimal XML Pattern Matching	2002	SIGMOD	0.00027226333
395	Containment and Equivalence for an XPath Fragment [Extended Abstract]	2002	PODS	0.00019298983
644	The Complexity of Query Reliability	1998	PODS	0.00015367965
1,041	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS	0.00012453494
2,569	ProTDB: Probabilistic Data in XML	2002	VLDB	8.4090027e-05
2,817	On the minimization of XPath queries	2003	VLDB	8.0945626e-05
3,075	Matching Twigs in Probabilistic XML	2007	VLDB	7.7839831e-05
3,318	On the Complexity of Managing Probabilistic XML Data	2007	PODS	7.5247776e-05
4,187	Maximally Joining Probabilistic Data	2007	PODS	6.8456588e-05
8,761	Incorporating Constraints in Probabilistic XML	2008	PODS	5.3766157e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,534	Efficient Rewriting of XPath Queries Using Query Set Specifications	2009	VLDB
2	9,641	ProApproX: A Lightweight Approximation Query Processor over Probabilistic Trees	2011	SIGMOD
3	12,711	An Algebraic Query Model for Effective and Efficient Retrieval of XML Fragments	2006	VLDB
4	6,508	Probabilistic XML via Markov Chains	2010	VLDB
5	3,180	Approximate XML Query Answers	2004	SIGMOD
6	5,298	Efficient Processing of XML Twig Queries with OR-Predicates	2004	SIGMOD
7	5,346	Running Tree Automata on Probabilistic XML	2009	PODS
8	12,325	Answering Queries using Views over Probabilistic XML: Complexity and Tractability	2012	VLDB
9	3,318	On the Complexity of Managing Probabilistic XML Data	2007	PODS
10	3,075	Matching Twigs in Probabilistic XML	2007	VLDB