Matching Twigs in Probabilistic XML

Summary: Twig queries with projection over probabilistic XML: tractable under data complexity; projection intractable in other models. Threshold-based partial answers (maximal by probability) and twig evaluation without projection under query-and-data complexity. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9582
Venue: VLDB
Year: 2007
Pagerank: 7.7845728e-05
Overall Rank: 2,978 | 79.29%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Benny Kimelfeld
2. Yehoshua Sagiv

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
321	MCDB: A Monte Carlo Approach to Managing Uncertain Data	2008	SIGMOD	0.00027527389
5,296	Running Tree Automata on Probabilistic XML	2009	PODS	5.5802694e-05
6,284	Probabilistic XML via Markov Chains	2010	VLDB	5.128131e-05
6,662	Selective Provenance for Datalog Programs Using Top-K Queries	2015	VLDB	4.9704872e-05
6,681	Query Efficiency in Probabilistic XML Models	2008	SIGMOD	4.9643102e-05
8,558	Incorporating Constraints in Probabilistic XML	2008	PODS	4.4937074e-05
12,215	Certain Answers for XML Queries	2010	PODS	4.1945683e-05
12,275	Navigating in Complex Mashed-Up Applications	2010	VLDB	4.1945683e-05
12,283	Optimal Top-K Query Evaluation for Weighted Business Processes	2010	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
74	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB	0.00057857292
431	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00023370207
450	The Theory Of Probabilistic Databases	1987	VLDB	0.00022822073
571	The Complexity of Query Reliability	1998	PODS	0.00019910719
1,032	Outerjoins as Disjunctions	1994	SIGMOD	0.00014544529
1,268	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS	0.00012931993
2,774	ProTDB: Probabilistic Data in XML	2002	VLDB	8.134432e-05
2,966	Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract)	1996	PODS	7.8002072e-05
3,589	On the Complexity of Managing Probabilistic XML Data	2007	PODS	6.9427709e-05
3,929	Maximally Joining Probabilistic Data	2007	PODS	6.6248763e-05
5,141	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.6673499e-05
8,072	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS	4.5922874e-05
9,511	Computing Full Disjunctions	2003	PODS	4.3340927e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,587	On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques	2005	SIGMOD	6.0658154e-05
3,419	Approximate XML Query Answers	2004	SIGMOD	7.1173416e-05
3,120	Holistic Twig Joins on Indexed XML Documents	2003	VLDB	7.5295938e-05
240	Holistic Twig Joins: Optimal XML Pattern Matching	2002	SIGMOD	0.00031603463
9,594	Fast Optimal Twig Joins	2010	VLDB	4.3197044e-05
5,296	Running Tree Automata on Probabilistic XML	2009	PODS	5.5802694e-05
12,129	Answering Queries using Views over Probabilistic XML: Complexity and Tractability	2012	VLDB	4.1945683e-05
5,574	Efficient Processing of XML Twig Queries with OR-Predicates	2004	SIGMOD	5.4268403e-05
3,589	On the Complexity of Managing Probabilistic XML Data	2007	PODS	6.9427709e-05
6,681	Query Efficiency in Probabilistic XML Models	2008	SIGMOD	4.9643102e-05