Satisfiability of Xpath on data trees

Figueira, Diego

doi:10.1145/3212019.3212021

Cited by 2 publications

(1 citation statement)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the satisfiability of DataXPath is undecidable [26], restricting the navigational power restores decidability [23]. The first decidable fragment we consider is VerticalXPath, shown decidable by Figueira and Segoufin [25,Thm.…”

Section: Data Xpathmentioning

confidence: 99%

Decidable XPath Fragments in the Real World

Baelde

Lick

Schmitz

2019

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

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. CCS CONCEPTS • Information systems → XPath; XQuery; • Theory of computation → Logic and verification; © David Baelde, Anthony Lick, and Sylvain Schmitz; licensed under Creative Commons License CC-BY-SA actually allows to answer several questions on the reliability and performance of a query; to wit: Usefulness: is the data query useful at all, i.e. will it select some parts of a well-formed document? The question is far from trivial in an environment where the data can be retrieved from external sources, prone to changes in their structure. This allows simple optimisations in batch processes, with significant savings [31]. Optimisation: can a query be replaced by another, simpler query? This is a classical question in query rewriting in database theory. This type of optimisation has for instance been applied to XPath queries without data joins by Genevès and Vion-Dury [28], with an appreciable impact on performance.

show abstract

Section: Data Xpathmentioning

confidence: 99%

Decidable XPath Fragments in the Real World

Baelde

Lick

Schmitz

2019

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

show abstract

Axiomatizing Hybrid XPath with Data

Areces¹,

Fervari²

2021

Logical Methods in Computer Science

View full text Add to dashboard Cite

In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended with hybrid operators. First, we present HXPath=, a multi-modal version of XPath with data, extended with nominals and the hybrid operator @. Then, we introduce an axiomatic system for HXPath=, and we prove it is strongly complete with respect to the class of abstract data models, i.e., data models in which data values are abstracted as equivalence relations. We prove a general completeness result similar to the one presented in, e.g., [BtC06], that ensures that certain extensions of the axiomatic system we introduce are also complete. The axiomatic systems that can be obtained in this way cover a large family of hybrid XPath languages over different classes of frames, for which we present concrete examples. In addition, we investigate axiomatizations over the class of tree models, structures widely used in practice. We show that a strongly complete, finitary, first-order axiomatization of hybrid XPath over trees does not exist, and we propose two alternatives to deal with this issue. We finally introduce filtrations to investigate the status of decidability of the satisfiability problem for these languages.

show abstract

Satisfiability of Xpath on data trees

Cited by 2 publications

References 39 publications

Decidable XPath Fragments in the Real World

Decidable XPath Fragments in the Real World

Axiomatizing Hybrid XPath with Data

Contact Info

Product

Resources

About