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

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.

[1]  Jan-Pascal van Best,et al.  Trips on Trees , 1999, Acta Cybern..

[2]  Bernhard Thalheim,et al.  Towards a theory of consistency enforcement , 1999, Acta Informatica.

[3]  Etsuro Moriya,et al.  On Two-Way Tree Automata , 1994, Inf. Process. Lett..

[4]  Klaus-Dieter Schewe.  Fundamentals of Consistency Enforcement , 1998, EJC.

[5]  B. Wuthrich.  On updates and inconsistency repairing in knowledge bases , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[6]  Greg Nelson,et al.  A generalization of Dijkstra's calculus , 1989, ACM Trans. Program. Lang. Syst..

[7]  Thomas Schwentick.  On Diving in Trees , 2000, MFCS.

[8]  Thomas Schwentick,et al.  On the power of tree-walking automata , 2000, Inf. Comput..

[9]  Frank Neven,et al.  Expressiveness of structured document query languages based on attribute grammars , 1998, JACM.

[10]  Dennis McLeod,et al.  An execution model for limited ambiguity rules and its application to derived data update , 1995, TODS.

[11]  Makoto Murata,et al.  Extended path expressions of XML , 2001, PODS.

[12]  Nicolas Spyratos,et al.  Maximal Expansions of Database Updates , 2000, FoIKS.

[13]  Frank Neven,et al.  Structured Document Transformations Based on XSL , 1999, DBPL.

[14]  Helmut Seidl,et al.  Locating Matches of Tree Patterns in Forests , 1998, FSTTCS.

[15]  M. Makkai.  Admissible Sets and Infinitary Logic , 1977 .

[16]  Frank Neven,et al.  Extensions of Attribute Grammars for Structured Document Queries , 1999, DBPL.

[17]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[18]  Thomas Schwentick,et al.  Query automata , 1999, PODS '99.

[19]  Y. Gurevich.  On Finite Model Theory , 1990 .

[20]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[21]  Donald D. Chamberlin,et al.  XQuery: a query language for XML , 2003, SIGMOD '03.

[22]  Ernest Teniente,et al.  Dealing with Modification Requests During View Updating and Integrity Constraint Maintenance , 2000, FoIKS.

[23]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, J. Comput. Syst. Sci..

[24]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[25]  Thomas Schwentick,et al.  On the Power of Tree-Walking Automata , 2000, ICALP.

[26]  Joost Engelfriet,et al.  A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars , 2000, J. Comput. Syst. Sci..

[27]  Derick Wood,et al.  Regular tree and regular hedge languages over unranked alphabets , 2001 .

[28]  Thomas Schwentick,et al.  Towards Regular Languages over Infinite Alphabets , 2001, MFCS.

[29]  Klaus-Dieter Schewe,et al.  An Arithmetic Theory of Consistency Enforcement , 2002, Acta Cybern..

[30]  Bernhard Thalheim,et al.  Limitations of Rule Triggering Systems for Integrity Maintenance in the Context of Transition Specifications , 1998, Acta Cybern..

[31]  Michael Gertz.  Specifying reactive integrity control for active databases , 1994, Proceedings of IEEE International Workshop on Research Issues in Data Engineering: Active Databases Systems.

[32]  Letizia Tanca,et al.  Automatic generation of production rules for integrity maintenance , 1994, TODS.

[33]  James Clark,et al.  XSL Transformations (XSLT) Version 1.0 , 1999 .

[34]  Joost Engelfriet,et al.  Tree-Walking Pebble Automata , 1999, Jewels are Forever.

[35]  Frank Neven,et al.  A formal model for an expressive fragment of XSLT , 2000, Inf. Syst..

[36]  Pierre Deransart,et al.  Attribute Grammars: Definitions, Systems and Bibliography , 1988 .

[37]  Thomas Schwentick,et al.  Expressive and efficient pattern languages for tree-structured data (extended abstract) , 2000, PODS '00.

[38]  Jorge Lobo,et al.  Minimal and Consistent Evolution of Knowledge Bases , 1997, J. Appl. Non Class. Logics.

[39]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[40]  Klaus-Dieter Schewe.  Consistency Enforcement in Entity-Relationship and Object-Oriented Models , 1998, Data Knowl. Eng..

[41]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[42]  Derick Wood,et al.  Caterpillars: A Context Specification Technique , 2000, Markup languages.

[43]  Tova Milo,et al.  Algebras for Querying Text Regions: Expressive Power and Optimization , 1998, J. Comput. Syst. Sci..