A Decision Procedure for XPath Containment

Pierre Genevès 1 Nabil Layaïda 1
1 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes
Abstract : XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath fragment covers most of the language features used in practice. Specifically, we show how XPath queries can be translated into equivalent formulas in monadic second-order logic. Using this translation, we construct an optimized logical formulation of the containment problem, which is decided using tree automata. When the containment relation does not hold between two XPath expressions, a counter-example XML tree is generated. We provide a complexity analysis together with practical experiments that illustrate the efficiency of the decision procedure for realistic scenarios.
Document type :
Reports
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070159
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:17:03 PM
Last modification on : Tuesday, October 9, 2018 - 12:28:01 PM
Long-term archiving on : Tuesday, February 22, 2011 - 11:37:01 AM

Identifiers

  • HAL Id : inria-00070159, version 1

Collections

Citation

Pierre Genevès, Nabil Layaïda. A Decision Procedure for XPath Containment. [Research Report] RR-5867, INRIA. 2006, pp.41. ⟨inria-00070159⟩

Share

Metrics

Record views

276

Files downloads

149