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.6103114e-05
Overall Rank: 3,133 | 78.95%
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.00023251151
5,478	Running Tree Automata on Probabilistic XML	2009	PODS	6.1147103e-05
6,641	Probabilistic XML via Markov Chains	2010	VLDB	5.7235263e-05
6,712	Selective Provenance for Datalog Programs Using Top-K Queries	2015	VLDB	5.70009e-05
7,060	Query Efficiency in Probabilistic XML Models	2008	SIGMOD	5.6086666e-05
8,931	Incorporating Constraints in Probabilistic XML	2008	PODS	5.2534908e-05
12,707	Certain Answers for XML Queries	2010	PODS	4.9769913e-05
12,767	Navigating in Complex Mashed-Up Applications	2010	VLDB	4.9769913e-05
12,775	Optimal Top-K Query Evaluation for Weighted Business Processes	2010	VLDB	4.9769913e-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.00042926566
421	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00018507815
571	The Theory of Probabilistic Databases	1987	VLDB	0.00016204158
660	The Complexity of Query Reliability	1998	PODS	0.00015045167
1,066	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS	0.00012194105
1,199	Outerjoins as Disjunctions	1994	SIGMOD	0.00011559895
2,619	ProTDB: Probabilistic Data in XML	2002	VLDB	8.2180287e-05
2,853	Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract)	1996	PODS	7.9375001e-05
3,379	On the Complexity of Managing Probabilistic XML Data	2007	PODS	7.3535108e-05
4,262	Maximally Joining Probabilistic Data	2007	PODS	6.6954238e-05
6,502	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.7622992e-05
8,241	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS	5.3686457e-05
9,795	Computing Full Disjunctions	2003	PODS	5.1241373e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,248	Approximate XML Query Answers	2004	SIGMOD
2	4,201	On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques	2005	SIGMOD
3	2,746	Holistic Twig Joins on Indexed XML Documents	2003	VLDB
4	179	Holistic Twig Joins: Optimal XML Pattern Matching	2002	SIGMOD
5	9,908	Fast Optimal Twig Joins	2010	VLDB
6	5,478	Running Tree Automata on Probabilistic XML	2009	PODS
7	12,622	Answering Queries using Views over Probabilistic XML: Complexity and Tractability	2012	VLDB
8	5,425	Efficient Processing of XML Twig Queries with OR-Predicates	2004	SIGMOD
9	3,379	On the Complexity of Managing Probabilistic XML Data	2007	PODS
10	7,060	Query Efficiency in Probabilistic XML Models	2008	SIGMOD