The Complexity of Query Containment in Expressive Fragments of XPath 2.0

Summary: Complexity map for CoreXPath+{intersection,equality,complementation,for‑loops,TC}: cases range EXPTIME, 2‑EXPTIME, to non‑elementary. Intersection typically adds one exponential; equality/TC usually inert (TC makes downward+intersection EXPSPACE→2‑EXPTIME); complementation/for‑loops cause non‑elementary; results extend to DTDs and satisfiability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: hbdd5598c2f577f94
Venue: PODS
Year: 2007
Pagerank: 6.4852899e-05
Overall Rank: 4,616 | 69.06%
DOI: 10.1145/1265530.1265541

Incoming Non-self Citations Over Time

Authors

1. Balder ten Cate (University of Amsterdam)
2. Carsten Lutz (Technical University of Dresden)

BibTeX Citation

@inproceedings{cate_pods07,
        address = {New York, NY, USA},
        series = {{PODS} '07},
        title = {{The Complexity of Query Containment in Expressive Fragments of XPath 2.0}},
        url = {https://dl.acm.org/doi/10.1145/1265530.1265541},
        doi = {10.1145/1265530.1265541},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Cate, Balder ten and Lutz, Carsten},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,761	High-Performance Complex Event Processing over XML Streams	2012	SIGMOD	6.4192245e-05
6,583	XPath, Transitive Closure Logic, and Nested Tree Walking Automata	2008	PODS	5.7240554e-05
9,458	Decidable XPath Fragments in the Real World	2019	PODS	5.1602672e-05
10,275	The (Almost) Complete Guide to Tree Pattern Containment	2015	PODS	5.0352713e-05
12,705	The Complexity of Text-Preserving XML Transformations	2011	PODS	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
409	Containment and Equivalence for an XPath Fragment [Extended Abstract]	2002	PODS	0.00018797031
1,606	Conjunctive Queries over Trees	2004	PODS	0.00010079487
1,983	XPath Satisfiability in the Presence of DTDs	2005	PODS	9.2451473e-05
3,806	The Expressivity of XPath with Transitive Closure*	2006	PODS	6.9902521e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,897	On the minimization of XPath queries	2003	VLDB
2	1,606	Conjunctive Queries over Trees	2004	PODS
3	6,333	Containment of Nested XML Queries	2004	VLDB
4	12,873	Efficient Rewriting of XPath Queries Using Query Set Specifications	2009	VLDB
5	3,806	The Expressivity of XPath with Transitive Closure*	2006	PODS
6	6,583	XPath, Transitive Closure Logic, and Nested Tree Walking Automata	2008	PODS
7	9,458	Decidable XPath Fragments in the Real World	2019	PODS
8	1,983	XPath Satisfiability in the Presence of DTDs	2005	PODS
9	2,195	The Complexity of XPath Query Evaluation	2003	PODS
10	409	Containment and Equivalence for an XPath Fragment [Extended Abstract]	2002	PODS