Satisfiability of XPath on data trees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM SIGLOG News Année : 2018

Satisfiability of XPath on data trees

Résumé

This is a survey on the satisfiability problem for XPath on data trees. Data trees are finite trees whose every node carries a label from a finite alphabet and a data value from an infinite domain. XPath is an expressive node selecting language for XML documents, which can be abstracted as data trees. Its satisfiability problem is in general undecidable. However, various fragments of XPath have decidable satisfiability problem, these are fragments defined in terms of the navigational axes which are allowed. We explore the state of the art in terms of decidability and discuss briefly some of the algorithmic techniques involved.
Fichier principal
Vignette du fichier
survey.pdf (498.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01670363 , version 1 (21-12-2017)
hal-01670363 , version 2 (23-03-2018)

Identifiants

Citer

Diego Figueira. Satisfiability of XPath on data trees. ACM SIGLOG News, 2018, 5 (2), pp.4-16. ⟨10.1145/3212019.3212021⟩. ⟨hal-01670363v2⟩

Collections

CNRS TDS-MACS ANR
255 Consultations
205 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More