XPath, Transitive Closure Logic, and Nested Tree Walking Automata
Summary: Shows that XPath with Kleene‑star and subtree‑relativisation captures exactly FO(MTC) and is characterized by nested tree‑walking automata, yielding a strict separation from MSO on trees (resolves an open question). Analyzes complexity: combined query evaluation in PTIME, while satisfiability, containment and automaton emptiness are 2ExpTime‑complete (Core XPath: ExpTime‑complete). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Balder ten Cate
- 2. Luc Segoufin
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,880 | High-Performance Complex Event Processing over XML Streams | 2012 | SIGMOD | 5.8573822e-05 |
| 12,296 | Satisfiability of Downward XPath with Data Equality Tests | 2009 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 713 | Efficient Algorithms for Processing XPath Queries | 2002 | VLDB | 0.00017731096 |
| 1,929 | XPath Satisfiability in the Presence of DTDs | 2005 | PODS | 0.00010058897 |
| 3,851 | The Expressivity of XPath with Transitive Closure* | 2006 | PODS | 6.7057867e-05 |
| 4,366 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS | 6.2538592e-05 |
| 5,716 | XML Transformation by Tree-Walking Transducers with Invisible Pebbles | 2007 | PODS | 5.3561157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,248 | The Complexity of XPath Query Evaluation | 2003 | PODS | 9.2038466e-05 |
| 12,491 | Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document | 2006 | PODS | 4.1945683e-05 |
| 499 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS | 0.000216753 |
| 8,314 | Conditional XPath, the first order complete XPath dialect* | 2004 | PODS | 4.5435639e-05 |
| 8,200 | On XPath with Transitive Axes and Data Tests | 2013 | PODS | 4.5602267e-05 |
| 13,753 | On the Power of Walking for Querying Tree-Structured Data | 2002 | PODS | - |
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 12,296 | Satisfiability of Downward XPath with Data Equality Tests | 2009 | PODS | 4.1945683e-05 |
| 4,366 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS | 6.2538592e-05 |
| 3,851 | The Expressivity of XPath with Transitive Closure* | 2006 | PODS | 6.7057867e-05 |