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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with lixto. In: 28th International Conference on Very Large Data Bases, pp. 119–128 (2001)
Berlea, A., Seidl, H.: Binary queries for document trees. Nordic Journal of Computing 11(1), 41–71 (2004)
Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Journal of Comput. and Syst. Sci. 61(1), 1–50 (2000)
Bruggemann-Klein, A., Wood, D., Murata, M.: Regular tree and regular hedge languages over unranked alphabets: Version 1 (April 07, 2001)
Carme, J., Lemay, A., Niehren, J.: Learning node selecting tree transducer from completely annotated examples. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 91–102. Springer, Heidelberg (2004)
Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105–118. Springer, Heidelberg (2004)
Castagna, G.: Patterns and types for querying XML. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 1–26. Springer, Heidelberg (2005)
Chomicki, J., Goldin, D.Q., Kuper, G.M.: Variable independence and aggregation closure. In: ACM Conference on Principle of Databases, pp. 40–48 (1996)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on http://www.grappa.univ-lille3.fr/tata
Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: 18th IEEE Symposium on Logic in Computer Science, pp. 188–197 (2003)
Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: Proceedings of the 17th LICS. LNCS, Copenhagen, pp. 189–202 (2002)
Gottlob, G., Koch, C., Baumgartner, R., Herzog, M., Flesca, S.: The Lixto data extraction project - back and forth between theory and practice. In: ACM Symposium on Principles of Database Systems. ACM Press, New York (2004)
Hosoya, H., Pierce, B.: Regular expression pattern matching for XML. Journal of Functional Programming 6(13), 961–1004 (2003)
Libkin, L.: Variable independence for first-order definable constraints. ACM Transactions on Computational Logics 4(4), 431–451 (2003)
Maneth, S., Berlea, A., Perst, T., Seidl, H.: Xml type checking with macro tree transducers. In: 24th ACM Symposium on Principles of Database Systems, pp. 283–294. ACM Press, New York (2005)
Martens, W., Niehren, J.: Minimizing tree automata for unranked trees. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 232–246. Springer, Heidelberg (2005)
Marx, M.: Conditional XPath, the first order complete XPath dialect. In: Proceedings of the symposium on Principles of database systems, pp. 13–22 (2004)
Neven, F., Bussche, J.V.D.: Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM 49(1), 56–100 (2002)
Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science 275(1-2), 633–674 (2002)
Seidl, H.: On the finite degree of ambiguity of finite tree automata. Acta Informatica 26(6), 527–542 (1989)
Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory 2, 57–82 (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niehren, J., Planque, L., Talbot, JM., Tison, S. (2005). N-Ary Queries by Tree Automata. In: Bierman, G., Koch, C. (eds) Database Programming Languages. DBPL 2005. Lecture Notes in Computer Science, vol 3774. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601524_14
Download citation
DOI: https://doi.org/10.1007/11601524_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30951-2
Online ISBN: 978-3-540-31445-5
eBook Packages: Computer ScienceComputer Science (R0)