Querying Unranked Trees with Stepwise Tree Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Querying Unranked Trees with Stepwise Tree Automata

Résumé

The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second-order logic. We prove this result by reduction to the ranked case, via a new systematic correspondence that relates unranked and ranked queries.

Domaines

Automatique
Fichier principal
Vignette du fichier
stepwise.pdf (178.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00536529 , version 1 (16-11-2010)

Identifiants

  • HAL Id : inria-00536529 , version 1

Citer

Julien Carme, Joachim Niehren, Marc Tommasi. Querying Unranked Trees with Stepwise Tree Automata. 19th International Conference on Rewriting Techniques and Applications, 2004, Aachen, Georgia. pp.105--118. ⟨inria-00536529⟩
146 Consultations
310 Téléchargements

Partager

Gmail Facebook X LinkedIn More