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: he90bddd3cb61ca52
Venue: VLDB
Year: 2007
Pagerank: 7.5857903e-05
Overall Rank: 3,143 | 78.94%
DOI: 10.14778/1325851.1325854

Incoming Non-self Citations Over Time

Authors

1. Benny Kimelfeld (Hebrew University)
2. Yehoshua Sagiv (Hebrew University)

BibTeX Citation

@article{kimelfeld_vldb07,
        title = {{Matching Twigs in Probabilistic XML}},
        author = {Kimelfeld, Benny and Sagiv, Yehoshua},
        journal = {PVLDB},
        series = {{VLDB} '07},
        volume = {30},
        number = {2},
        pages = {27--38},
        doi = {10.14778/1325851.1325854},
        url = {https://doi.org/10.14778/1325851.1325854},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
245	MCDB: A Monte Carlo Approach to Managing Uncertain Data	2008	SIGMOD	0.00023188414
5,495	Running Tree Automata on Probabilistic XML	2009	PODS	6.0944915e-05
6,651	Probabilistic XML via Markov Chains	2010	VLDB	5.7046046e-05
6,728	Selective Provenance for Datalog Programs Using Top-K Queries	2015	VLDB	5.6812425e-05
7,080	Query Efficiency in Probabilistic XML Models	2008	SIGMOD	5.5901209e-05
8,951	Incorporating Constraints in Probabilistic XML	2008	PODS	5.2361195e-05
12,750	Certain Answers for XML Queries	2010	PODS	4.9605343e-05
12,810	Navigating in Complex Mashed-Up Applications	2010	VLDB	4.9605343e-05
12,818	Optimal Top-K Query Evaluation for Weighted Business Processes	2010	VLDB	4.9605343e-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
51	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB	0.00042804864
424	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00018448553
573	The Theory of Probabilistic Databases	1987	VLDB	0.00016152578
661	The Complexity of Query Reliability	1998	PODS	0.00014996933
1,071	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS	0.00012154243
1,201	Outerjoins as Disjunctions	1994	SIGMOD	0.00011523243
2,627	ProTDB: Probabilistic Data in XML	2002	VLDB	8.1909465e-05
2,861	Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract)	1996	PODS	7.9122274e-05
3,390	On the Complexity of Managing Probabilistic XML Data	2007	PODS	7.3292374e-05
4,277	Maximally Joining Probabilistic Data	2007	PODS	6.67394e-05
6,514	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.7438288e-05
8,259	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS	5.351182e-05
9,828	Computing Full Disjunctions	2003	PODS	5.1074821e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,263	Approximate XML Query Answers	2004	SIGMOD
2	4,219	On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques	2005	SIGMOD
3	2,756	Holistic Twig Joins on Indexed XML Documents	2003	VLDB
4	180	Holistic Twig Joins: Optimal XML Pattern Matching	2002	SIGMOD
5	9,943	Fast Optimal Twig Joins	2010	VLDB
6	5,495	Running Tree Automata on Probabilistic XML	2009	PODS
7	12,665	Answering Queries using Views over Probabilistic XML: Complexity and Tractability	2012	VLDB
8	5,443	Efficient Processing of XML Twig Queries with OR-Predicates	2004	SIGMOD
9	3,390	On the Complexity of Managing Probabilistic XML Data	2007	PODS
10	7,080	Query Efficiency in Probabilistic XML Models	2008	SIGMOD