Weak Inclusion for Recursive XML Types

Abstract : Considering that the unranked tree languages L(G) and L(G') are those defined by given possibly-recursive XML types G and G' , this paper proposes a method to verify whether L(G) is "approximatively" included in L(G'). The approximation consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-00701201
Contributor : Pierre Réty <>
Submitted on : Thursday, May 24, 2012 - 5:17:13 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Identifiers

  • HAL Id : hal-00701201, version 1

Collections

Citation

Pierre Réty, Jacques Chabin, Joshua Amavi. Weak Inclusion for Recursive XML Types. CIAA - 2012, Jul 2012, Porto, Portugal. pp.78-89. ⟨hal-00701201⟩

Share

Metrics

Record views

104