Skip to Main content Skip to Navigation
Conference papers

N-ary Queries by Tree Automata

Abstract : 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.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 1:32:19 PM
Last modification on : Thursday, July 25, 2019 - 8:50:03 AM
Long-term archiving on: : Thursday, February 17, 2011 - 2:58:00 AM


Files produced by the author(s)


  • 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⟩



Les métriques sont temporairement indisponibles