N-ary Queries by Tree Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

N-ary Queries by Tree Automata


We investigate n-ary node selection queries in trees by successful runs of tree automata. We show that run-based n-ary queries capture MSO, contribute algorithms for enumerating answers of n-ary queries, and study the complexity of the problem. We investigate the subclass of run-based n-ary queries by unambiguous tree automata. Keywords: XML databases, logic, automata.
Fichier principal
Vignette du fichier
n-ary-query.pdf (158.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : inria-00536522 , version 1


Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison. N-ary Queries by Tree Automata. 10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.217--231. ⟨inria-00536522⟩
140 View
214 Download


Gmail Facebook Twitter LinkedIn More