Weak Inclusion for XML Types - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Weak Inclusion for XML Types

Résumé

Considering that the unranked tree languages L(G) and L(G') are those defined by given non-recursive XML types G and G', this paper proposes a simple and intuitive method to verify whether L(G) is ''approximatively'' included in L(G'). Our approximative criterion consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

inria-00594520 , version 1 (20-05-2011)

Identifiants

  • HAL Id : inria-00594520 , version 1

Citer

Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty. Weak Inclusion for XML Types. International Conference on Implementation and Application of Automata (CIAA), Jul 2011, Blois, France. pp.30-41. ⟨inria-00594520⟩
49 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More