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.
Supplemental Material
- S. Abiteboul, P. Buneman, D. Suciu. Data on the Web. Morgan Kaufmann, 2000.Google Scholar
- M. Bartha. An algebraic definition of attributed transformations. Acta Cybernetica 5, 409--421, 1982.Google Scholar
- G. J. Bex, S. Maneth, F. Neven. A formal model for an expressive fragment of XSLT. Information Systems 27, 21--39, 2002. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- M. Bojanczyk, M. Samuelides, T. Schwentick, L. Segoufin. Expressive power of pebble automata. Proc. ICALP'06, LNCS 4051, 157--168, 2006. Google Scholar
Digital Library
- A. Brüggemann-Klein, D. Wood. Caterpillars, context, tree automata and tree pattern matching. Proc. DLT'99, World Scienti.c, 270--285, 1999.Google Scholar
- B. ten Cate. The expressivity of XPath with transitive closure. Proc. PODS'06, ACM Press, 328--337, 2006. Google Scholar
Digital Library
- J. Doner. Tree acceptors and some of their applications. J. Comput. and Syst. Sci. 4, 406--451, 1970.Google Scholar
Digital Library
- J. Engelfriet, H. J. Hoogeboom. Tree-walking pebble automata. In: Jewels are forever, Springer-Verlag, 72--83, 1999. Google Scholar
Digital Library
- J. Engelfriet, H. J. Hoogeboom, J. -P. Van Best. Trips on trees. Acta Cybernetica 14, 51--64, 1999. Google Scholar
Digital Library
- J. Engelfriet, S. Maneth. A comparison of pebble tree transducers with macro tree transducers. Acta Inform. 39, 613--698, 2003.Google Scholar
Digital Library
- J. Engelfriet, H. Vogler. Pushdown machines for the macro tree transducer. Theor. Comput. Sci. 42, 251--368, 1986. Google Scholar
Digital Library
- M. J. Fischer. Grammars with macro-like productions. Ph.D. Thesis, Harvard University, 1968.Google Scholar
- E. Goris, M. Marx. Looping caterpillars. Proc. LICS'05, IEEE, 51--60, 2005. Google Scholar
Digital Library
- G. Gottlob, C. Koch, R. Pichler. Efficient algorithms for processing XPath queries. Proc. VLDB'02, Morgan Kaufmann, 95--106, 2002.Google Scholar
Digital Library
- G. Gottlob, C. Koch, K. U. Schulz. Conjunctive queries over trees. Proc. PODS'04, ACM Press, 189--200, 2004. Google Scholar
Digital Library
- W. Janssen, A. Korlyukov, J. Van den Bussche. On the tree-transformation power of XSLT. Acta Inform. 43, 371--393, 2007. Google Scholar
Digital Library
- S. Maneth, A. Berlea, T. Perst, H. Seidl. XML type checking with macro tree transducers. Proc. PODS'05, ACM Press, 283--294, 2005. Google Scholar
Digital Library
- S. Maneth, F. Neven. Structured document transformation based on XSL. Proc. DBPL'99, LNCS 1949, 2000, 80--98. Google Scholar
Digital Library
- M. Marx. Conditional XPath. ACM T. Database Syst. 30, 929--959, 2005. Google Scholar
Digital Library
- M. Marx. Navigation in XML trees. In: The Logic in Computer Science Column, Bull. EATCS 88, 126--140, February 2006.Google Scholar
- T. Milo, D. Suciu, V. Vianu. Typechecking for XML transformers. J. Comput. Syst. Sci. 66, 66--97, 2003. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- T. Perst, H. Seidl. Macro forest transducers. Inform. Process. Lett. 89, 141--149, 2004. Google Scholar
Digital Library
- B. Samwel. Pebble scope and the power of pebble tree transducers. M.Sc. Thesis, LIACS, Leiden University, 2006.Google Scholar
- G. Slutzki. Alternating tree automata. Theor. Comput. Sci. 41, 305--318, 1985. Google Scholar
Digital Library
- 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 Scholar
Cross Ref
Index Terms
XML transformation by tree-walking transducers with invisible pebbles
Recommendations
Pebble alternating tree-walking automata and their recognizing power
Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for ...
Look-ahead removal for total deterministic top-down tree transducers
Top-down tree transducers are a convenient formalism for describing tree transformations. They can be equipped with regular look-ahead, which allows them to inspect a subtree before processing it. In certain cases, such a look-ahead can be avoided and ...
A comparison of pebble tree transducers with macro tree transducers
The n -pebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation $\tau$ of an n -pebble tree transducer can be realized by a composition of n +1 0-...






Comments