Satisfiability of Downward XPath with Data Equality Tests
Summary: Proves satisfiability of downward XPath with data equality/inequality (descendant*, child, =) is decidable and ExpTime-complete, even with Kleene-star and without DTDs or the sibling axis. Introduces a novel data-tree automaton with ExpTime emptiness and pins exact complexities of several downward fragments. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,200 | On XPath with Transitive Axes and Data Tests | 2013 | PODS | 4.5602267e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,851 | The Expressivity of XPath with Transitive Closure* | 2006 | PODS | 6.7057867e-05 |
| 4,073 | Two-Variable Logic on Data Trees and XML Reasoning | 2006 | PODS | 6.4719397e-05 |
| 6,150 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS | 5.1846373e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,491 | Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document | 2006 | PODS | 4.1945683e-05 |
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 4,366 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS | 6.2538592e-05 |
| 9,105 | Decidable XPath Fragments in the Real World | 2019 | PODS | 4.3953995e-05 |
| 499 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS | 0.000216753 |
| 4,625 | On Testing Satisfiability of Tree Pattern Queries | 2004 | VLDB | 6.0406081e-05 |
| 6,150 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS | 5.1846373e-05 |
| 4,073 | Two-Variable Logic on Data Trees and XML Reasoning | 2006 | PODS | 6.4719397e-05 |
| 1,929 | XPath Satisfiability in the Presence of DTDs | 2005 | PODS | 0.00010058897 |
| 8,200 | On XPath with Transitive Axes and Data Tests | 2013 | PODS | 4.5602267e-05 |