Skip to Main content Skip to Navigation
New interface
Conference papers

Decidable XPath Fragments in the Real World

Abstract : XPath is arguably the most popular query language for selecting elements in XML documents. Besides query evaluation, query satisfiability and containment are the main computational problems for XPath; they are useful, for instance, to detect dead code or validate query optimisations. These problems are undecidable in general, but several fragments have been identified over time for which satisfiability (or query containment) is decidable: CoreXPath 1.0 and 2.0 without so-called data joins, fragments with data joins but limited navigation, etc. However, these fragments are often given in a simplified syntax, and sometimes wrt. a simplified XPath semantics. Moreover, they have been studied mostly with theoretical motivations, with little consideration for the practically relevant features of XPath. To investigate the practical impact of these theoretical fragments, we design a benchmark compiling thousands of real-world XPath queries extracted from open-source projects. These queries are then matched against syntactic fragments from the literature. We investigate how to extend these fragments with seldom-considered features such as free variables, data tests, data joins, and the last() and id() functions, for which we provide both undecidability and decidability results. We analyse the coverage of the original and extended fragments, and further provide a glimpse at which other practically-motivated features might be worth investigating in the future.
Keywords : Satisfiability XPath
Complete list of metadata

Cited literature [48 references]  Display  Hide  Download
Contributor : Sylvain Schmitz Connect in order to contact the contributor
Submitted on : Thursday, August 2, 2018 - 9:32:42 AM
Last modification on : Wednesday, June 8, 2022 - 12:50:04 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - ShareAlike 4.0 International License



David Baelde, Anthony Lick, Sylvain Schmitz. Decidable XPath Fragments in the Real World. 38th ACM Symposium on Principles of Database Systems (PODS'19), 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩. ⟨hal-01852475⟩



Record views


Files downloads