The Expressivity of XPath with Transitive Closure*
Summary: Extend Core XPath with transitive closure and path equalities to define Regular XPath*, proven expressively complete for FO* (first-order logic with a binary transitive-closure operator). Consequences: closure under path intersection/complementation and characterizations of the *-positive fragment and mu-Regular XPath (least fixed points). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,366 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS | 6.2538592e-05 |
| 4,880 | High-Performance Complex Event Processing over XML Streams | 2012 | SIGMOD | 5.8573822e-05 |
| 5,716 | XML Transformation by Tree-Walking Transducers with Invisible Pebbles | 2007 | PODS | 5.3561157e-05 |
| 6,150 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS | 5.1846373e-05 |
| 6,847 | TriAL for RDF: Adapting Graph Query Languages for RDF Data | 2013 | PODS | 4.9089877e-05 |
| 7,392 | From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences | 2010 | VLDB | 4.7429265e-05 |
| 9,105 | Decidable XPath Fragments in the Real World | 2019 | PODS | 4.3953995e-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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 114 | A Query Language and Optimization Techniques for Unstructured Data | 1996 | SIGMOD | 0.00046339735 |
| 499 | Containment and Equivalence for an XPath Fragment [Extended Abstract] | 2002 | PODS | 0.000216753 |
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 2,248 | The Complexity of XPath Query Evaluation | 2003 | PODS | 9.2038466e-05 |
| 2,584 | Expressive and efficient pattern languages for tree-structured data (extended abstract) | 2000 | PODS | 8.4948053e-05 |
| 6,963 | Query Translation from XPath to SQL in the Presence of Recursive DTDs | 2005 | VLDB | 4.8828629e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 7,361 | Extended Path Expressions for XML | 2001 | PODS | 4.7524599e-05 |
| 12,296 | Satisfiability of Downward XPath with Data Equality Tests | 2009 | PODS | 4.1945683e-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 |
| 8,200 | On XPath with Transitive Axes and Data Tests | 2013 | PODS | 4.5602267e-05 |
| 12,491 | Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document | 2006 | PODS | 4.1945683e-05 |
| 8,314 | Conditional XPath, the first order complete XPath dialect* | 2004 | PODS | 4.5435639e-05 |
| 4,366 | The Complexity of Query Containment in Expressive Fragments of XPath 2.0 | 2007 | PODS | 6.2538592e-05 |
| 6,150 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS | 5.1846373e-05 |