Skip to Main content Skip to Navigation
New interface
Conference papers

Recursive queries on trees and data trees

Abstract : The analysis of datalog programs over relational structures has been studied in depth, most notably the problem of con- tainment. The analysis problems that have been considered were shown to be undecidable with the exception of (i) con- tainment of arbitrary programs in nonrecursive ones, (ii) containment of monadic programs, and (iii) emptiness. In this paper, we are concerned with a much less studied prob- lem, the analysis of datalog programs over data trees. We show that the analysis of datalog programs is more complex for data trees than for arbitrary structures. In particular, we prove that the three aforementioned problems are unde- cidable for data trees. But in practice, data trees (e.g., XML trees) are often of bounded depth. We prove that all three problems are decidable over bounded depth data trees. Another contribution of the paper is the study of a new form of automata called pattern automata, that are essen- tially equivalent to linear datalog programs. We use pat- tern automata to show that the emptiness problem for lin- ear monadic datalog programs with data value inequalities is decidable over arbitrary data trees.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Émilien Antoine Connect in order to contact the contributor
Submitted on : Monday, April 8, 2013 - 7:22:24 PM
Last modification on : Saturday, June 25, 2022 - 7:46:27 PM
Long-term archiving on: : Monday, April 3, 2017 - 2:28:18 AM


Files produced by the author(s)


  • HAL Id : hal-00809297, version 1


Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu. Recursive queries on trees and data trees. Proceedings of the 16th International Conference on Database Theory, Mar 2013, Genoa, Italy. ⟨hal-00809297⟩



Record views


Files downloads