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: 9583
Venue: VLDB
Year: 2007
Pagerank: 7.7783189e-05
Overall Rank: 2,981 | 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
322	MCDB: A Monte Carlo Approach to Managing Uncertain Data	2008	SIGMOD	0.00027523667
5,301	Running Tree Automata on Probabilistic XML	2009	PODS	5.5749031e-05
6,284	Probabilistic XML via Markov Chains	2010	VLDB	5.1232186e-05
6,665	Selective Provenance for Datalog Programs Using Top-K Queries	2015	VLDB	4.9657158e-05
6,682	Query Efficiency in Probabilistic XML Models	2008	SIGMOD	4.9596732e-05
8,555	Incorporating Constraints in Probabilistic XML	2008	PODS	4.4893996e-05
12,223	Certain Answers for XML Queries	2010	PODS	4.1905499e-05
12,283	Navigating in Complex Mashed-Up Applications	2010	VLDB	4.1905499e-05
12,291	Optimal Top-K Query Evaluation for Weighted Business Processes	2010	VLDB	4.1905499e-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.00057797415
432	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00023349408
453	The Theory Of Probabilistic Databases	1987	VLDB	0.00022801484
572	The Complexity of Query Reliability	1998	PODS	0.00019888988
1,034	Outerjoins as Disjunctions	1994	SIGMOD	0.00014532543
1,269	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS	0.00012911894
2,783	ProTDB: Probabilistic Data in XML	2002	VLDB	8.1268718e-05
2,972	Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract)	1996	PODS	7.7933514e-05
3,592	On the Complexity of Managing Probabilistic XML Data	2007	PODS	6.9362111e-05
3,929	Maximally Joining Probabilistic Data	2007	PODS	6.620459e-05
5,137	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.6653126e-05
8,076	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS	4.587923e-05
9,512	Computing Full Disjunctions	2003	PODS	4.3299485e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,584	On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques	2005	SIGMOD	6.0599995e-05
3,421	Approximate XML Query Answers	2004	SIGMOD	7.1107127e-05
3,125	Holistic Twig Joins on Indexed XML Documents	2003	VLDB	7.5228453e-05
239	Holistic Twig Joins: Optimal XML Pattern Matching	2002	SIGMOD	0.00031581944
9,594	Fast Optimal Twig Joins	2010	VLDB	4.3155661e-05
5,301	Running Tree Automata on Probabilistic XML	2009	PODS	5.5749031e-05
12,137	Answering Queries using Views over Probabilistic XML: Complexity and Tractability	2012	VLDB	4.1905499e-05
5,580	Efficient Processing of XML Twig Queries with OR-Predicates	2004	SIGMOD	5.4216254e-05
3,592	On the Complexity of Managing Probabilistic XML Data	2007	PODS	6.9362111e-05
6,682	Query Efficiency in Probabilistic XML Models	2008	SIGMOD	4.9596732e-05