N-ary Queries by Tree Automata
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...