Skip to main content
Springer Nature Link
Log in

Automata- and Logic-Based Pattern Languages for Tree-Structured Data

  • Conference paper
  • First Online:
Semantics in Databases (SiD 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2582))

Included in the following conference series:

Abstract

This paper surveys work of the authors on pattern languages for tree-structured data with XML as the main application in mind. The main focus is on formalisms from formal language theory and logic. In particular, it considers attribute grammars, query automata, tree-walking automata, extensions of first-order logic, and monadic second-order logic. It investigates expressiveness as well as the complexity of query evaluation and some optimization problems. Finally, formalisms that allow comparison of attribute values are considered.

Research Assistant of the Fund for Scientific Research, Flanders.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27:217–274, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. 1st International Conference on Computational Logic, pages 1137–1151, Lecture Notes in Artificial Intelligence, volume 1861. Springer, 2000.

    Google Scholar 

  3. R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Journal of Computer and System Sciences, 61(1):1–50, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1, April 3, 2001. Technical report, HKUST-TCSC-2001-05, Hong Kong University of Science & Technology, 2001.

    Google Scholar 

  5. A. Brüggemann-Klein and D. Wood. Caterpillars: A Context Specification Technique. Markup Languages, 2(1):81–106, 2000.

    Article  Google Scholar 

  6. D. Chamberlin, D. Florescu, J. Robie, J. Siméon, and M. Stefanescu. XQuery: a query language for XML. Latest version: http://www.w3.org/TR/xquery/.

  7. J. Clark. XSL Transformations (XSLT) Version 1.0. Latest version: http://www.w3.org/TR/xslt.

  8. M. Consens and T. Milo. Algebras for querying text regions: Expressive power and optimization. Journal of Computer and System Sciences, 3:272–288, 1998.

    Article  MathSciNet  Google Scholar 

  9. P. Deransart, M. Jourdan, and B. Lorho. Attribute Grammars: Definition, Systems and Bibliography, volume 323 of Lecture Notes in Computer Science. Springer, 1988.

    Google Scholar 

  10. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.

    Google Scholar 

  11. J. Engelfriet and H. J. Hoogeboom. Tree-walking pebble automata. In J. Karhumäki, H. Maurer, G. Paun, and G. Rozenberg, editors, Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pages 72–83. Springer-Verlag, 1999.

    Google Scholar 

  12. J. Engelfriet, H.J. Hoogeboom, and J.-P. van Best. Trips on trees. Acta Cybernetica, 14:51–64, 1999.

    MATH  MathSciNet  Google Scholar 

  13. M. Fernandez, J. Siméon, and P. Wadler, editors. XML Query languages: Experiences and Exemplars, 1999. http://www-db.research.bell-labs.com/user/simeon/xquery.html.

  14. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1. Springer, 1997.

    Google Scholar 

  15. M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329–363, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. D.E. Knuth. Semantics of context-free languages. Mathematical Systems Theory, 2(2):127–145, 1968. See also Mathematical Systems Theory, 5(2):95-96, 1971.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Maneth and F. Neven. Structured Document Transformations Based on XSL. In R. Conner, A. Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming, volume 1949 of Lecture Notes in Computer Science, pages 80–98. Springer 2000.

    Chapter  Google Scholar 

  18. A. R. Meyer. Weak monadic second-order theory of successor is not elementary recursive. In R. Parikh, editors, Logic Colloquim, volume 453 of Lecture Notes in Mathematics, pages 132–154. Springer, 1975.

    Google Scholar 

  19. T. Milo, D. Suciu, and V. Vianu. Type checking for XML transformers. In Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems, pages 11–22. ACM Press, 2000.

    Google Scholar 

  20. E. Moriya. On two-way tree automata. Information Processing Letters, 50:117–121, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  21. M. Murata. Extended Path Expressions for XML. To appear in Proceedings of the Twentieth ACM Symposium on Principles of Database Systems. ACM Press, 2001.

    Google Scholar 

  22. F. Neven. Extensions of attribute grammars for structured document queries. In R. Conner, A. Mendelzon, editor, Research Issues in Structured and Semistructured Database Programming, volume 1949 of Lecture Notes in Computer Science, pages 99–116. Springer 2000.

    Chapter  Google Scholar 

  23. F. Neven and T. Schwentick. Query automata. To appear in Theoretical Computer Science. Extended abstrast in Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems, pages 205–214. ACM Press, 1999.

    Google Scholar 

  24. F. Neven and T. Schwentick. Expressive and efficient pattern languages for treestructured data. In Proc. 19th Symposium on Principles of Database Systems (PODS 2000), Dallas, pages 145–156, 2000.

    Google Scholar 

  25. F. Neven and T. Schwentick. On the power of tree-walking automata. To appear in Information and Computation. Extended abstract in 27th International Colloquium on Automata, Languages and Programming, pages 547–560, Lecture Notes in Computer Science, volume 1853. Springer, 2000.

    Google Scholar 

  26. F. Neven, T. Schwentick, and V. Vianu. Towards regular languages over infinte alphabets. Submitted.

    Google Scholar 

  27. F. Neven and J. Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. To appear in the Journal of the ACM. Extended abstract appeared in Proceedings of the Seventeenth ACM Symposium on Principles of Database Systems, pages 11–17. ACM Press, 1998.

    Google Scholar 

  28. A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In V. Arvind and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, pages 134–145, Lecture Notes in Computer Science, volume 1530. Springer, 1998.

    Google Scholar 

  29. T. Schwentick. On Diving in Trees. In M. Nielsen and B. Rovan, editors, Mathematical Foundations of Computer Science (MFCS 2000), pages 660–669, Lecture Notes in Computer Science, volume 1893. Springer, 2000

    Chapter  Google Scholar 

  30. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 7. Springer, 1997.

    Google Scholar 

  31. World Wide Web Consortium. XML Query Requirements. Latest version: http://www.w3.org/TR/xmlquery-reg.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Limburg, Germany

    Frank Neven

  2. Philipps-Universität Marburg, Germany

    Thomas Schwentick

Authors
  1. Frank Neven
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Schwentick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, Herzberg Building, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Leopoldo Bertossi

  2. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, P.O. Box 127, 1364, Budapest, Hungary

    Gyula O. H. Katona

  3. Department of Information Systems, Massey University, Private Bag 11222, Palmerston North, New Zealand

    Klaus-Dieter Schewe

  4. Institute of Computer Science, Brandenburg University of Technology at Cottbus, P.O. Box 10 13 44, 03013, Cottbus, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neven, F., Schwentick, T. (2003). Automata- and Logic-Based Pattern Languages for Tree-Structured Data. In: Bertossi, L., Katona, G.O.H., Schewe, KD., Thalheim, B. (eds) Semantics in Databases. SiD 2001. Lecture Notes in Computer Science, vol 2582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36596-6_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-36596-6_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00957-3

  • Online ISBN: 978-3-540-36596-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics