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 :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00000391
Contributor : Pierre Genevès <>
Submitted on : Tuesday, October 4, 2005 - 2:58:57 PM
Last modification on : Tuesday, October 9, 2018 - 12:28:01 PM
Long-term archiving on : Tuesday, June 2, 2015 - 2:10:14 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : jamais

Please log in to resquest access to the document

Identifiers

  • HAL Id : inria-00000391, version 1

Collections

Citation

Pierre Genevès, Nabil Layaïda. A Decision Procedure for XPath Containment. ACM Transactions on Information Systems, Association for Computing Machinery, 2005. ⟨inria-00000391⟩

Share

Metrics

Record views

158