skip to main content
10.1145/1265530.1265540acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

XML transformation by tree-walking transducers with invisible pebbles

Published:11 June 2007Publication History

ABSTRACT

The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of "invisible" pebbles (as opposed to the usual ("visible" ones). The resulting pebble tree automata recognize the regular tree languages (i.e., can validate all generalized DTD's) and hence can find all matches of MSO definable n-ary patterns. Moreover, when viewed as a navigational device, they lead to an XPath-like formalism that has a path expression for every MSO definable binary pattern. The resulting pebbletree transducers can apply arbitrary MSO definable tests to (the observable part of) their configurations, they (still) have a decidable typechecking problem, and they can model the recursion mechanism of XSLT. The time complexity ofthe typechecking problem for conjunctive queries that use MSO definable binary patterns can often be reduced through the use of invisible pebbles.

Skip Supplemental Material Section

Supplemental Material

High Resolution
Low Resolution

References

  1. S. Abiteboul, P. Buneman, D. Suciu. Data on the Web. Morgan Kaufmann, 2000.Google ScholarGoogle Scholar
  2. M. Bartha. An algebraic definition of attributed transformations. Acta Cybernetica 5, 409--421, 1982.Google ScholarGoogle Scholar
  3. G. J. Bex, S. Maneth, F. Neven. A formal model for an expressive fragment of XSLT. Information Systems 27, 21--39, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Bloem, J. Engelfriet. Monadic second order logic and node relations on graphs and trees. In: Structures in Logic and Computer Science, LNCS 1261, 144--161, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Bojanczyk, M. Samuelides, T. Schwentick, L. Segoufin. Expressive power of pebble automata. Proc. ICALP'06, LNCS 4051, 157--168, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Brüggemann-Klein, D. Wood. Caterpillars, context, tree automata and tree pattern matching. Proc. DLT'99, World Scienti.c, 270--285, 1999.Google ScholarGoogle Scholar
  7. B. ten Cate. The expressivity of XPath with transitive closure. Proc. PODS'06, ACM Press, 328--337, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Doner. Tree acceptors and some of their applications. J. Comput. and Syst. Sci. 4, 406--451, 1970.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Engelfriet, H. J. Hoogeboom. Tree-walking pebble automata. In: Jewels are forever, Springer-Verlag, 72--83, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Engelfriet, H. J. Hoogeboom, J. -P. Van Best. Trips on trees. Acta Cybernetica 14, 51--64, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Engelfriet, S. Maneth. A comparison of pebble tree transducers with macro tree transducers. Acta Inform. 39, 613--698, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Engelfriet, H. Vogler. Pushdown machines for the macro tree transducer. Theor. Comput. Sci. 42, 251--368, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. J. Fischer. Grammars with macro-like productions. Ph.D. Thesis, Harvard University, 1968.Google ScholarGoogle Scholar
  14. E. Goris, M. Marx. Looping caterpillars. Proc. LICS'05, IEEE, 51--60, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Gottlob, C. Koch, R. Pichler. Efficient algorithms for processing XPath queries. Proc. VLDB'02, Morgan Kaufmann, 95--106, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Gottlob, C. Koch, K. U. Schulz. Conjunctive queries over trees. Proc. PODS'04, ACM Press, 189--200, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. W. Janssen, A. Korlyukov, J. Van den Bussche. On the tree-transformation power of XSLT. Acta Inform. 43, 371--393, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Maneth, A. Berlea, T. Perst, H. Seidl. XML type checking with macro tree transducers. Proc. PODS'05, ACM Press, 283--294, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. Maneth, F. Neven. Structured document transformation based on XSL. Proc. DBPL'99, LNCS 1949, 2000, 80--98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Marx. Conditional XPath. ACM T. Database Syst. 30, 929--959, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Marx. Navigation in XML trees. In: The Logic in Computer Science Column, Bull. EATCS 88, 126--140, February 2006.Google ScholarGoogle Scholar
  22. T. Milo, D. Suciu, V. Vianu. Typechecking for XML transformers. J. Comput. Syst. Sci. 66, 66--97, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Møller, M. I. Schwartzbach. The design space of type checkers for XML transformation languages. Proc. ICDT'05, LNCS 3363, 17--36, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. F. Neven, T. Schwentick. Automata- and logic-based pattern languages for tree-structured data. In: Semantics in Databases 2001, LNCS 2582, 160--178, 2003.Google ScholarGoogle Scholar
  25. T. Perst, H. Seidl. Macro forest transducers. Inform. Process. Lett. 89, 141--149, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. B. Samwel. Pebble scope and the power of pebble tree transducers. M.Sc. Thesis, LIACS, Leiden University, 2006.Google ScholarGoogle Scholar
  27. G. Slutzki. Alternating tree automata. Theor. Comput. Sci. 41, 305--318, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. J. W. Thatcher, J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Syst. Theory 2, 57--81, 1968.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. XML transformation by tree-walking transducers with invisible pebbles

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2007
          328 pages
          ISBN:9781595936851
          DOI:10.1145/1265530

          Copyright © 2007 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 11 June 2007

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate476of1,835submissions,26%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!