Skip to Main content Skip to Navigation
Conference papers

Querying Unranked Trees with Stepwise Tree Automata

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 1:41:40 PM
Last modification on : Thursday, January 20, 2022 - 4:13:42 PM
Long-term archiving on: : Thursday, February 17, 2011 - 2:58:34 AM


Files produced by the author(s)


  • HAL Id : inria-00536529, version 1



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⟩



Les métriques sont temporairement indisponibles