Skip to Main content Skip to Navigation
Conference papers

On XPath with transitive axes and data tests

Abstract : We study the satisfiability problem for XPath with data equality tests. XPath is a node selecting language for XML documents whose satisfiability problem is known to be unde-cidable, even for very simple fragments. However, we show that the satisfiability for XPath with the rightward, leftward and downward reflexive-transitive axes (namely following-sibling-or-self, preceding-sibling-or-self, descendant-or-self) is decidable. Our algorithm yields a complexity of 3ExpSpace, and we also identify an expressive-equivalent normal form for the logic for which the satisfiability problem is in 2Exp-Space. These results are in contrast with the undecidabil-ity of the satisfiability problem as soon as we replace the reflexive-transitive axes with just transitive (non-reflexive) ones.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Diego Figueira Connect in order to contact the contributor
Submitted on : Friday, May 18, 2018 - 10:54:37 AM
Last modification on : Wednesday, November 24, 2021 - 9:54:07 AM
Long-term archiving on: : Monday, September 24, 2018 - 1:08:14 PM


Files produced by the author(s)




Diego Figueira. On XPath with transitive axes and data tests. ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), Jun 2013, New York, NY, United States. ⟨10.1145/2463664.2463675⟩. ⟨hal-01795148⟩



Les métriques sont temporairement indisponibles