Expressive and efficient pattern languages for tree-structured data (extended abstract)

It would be desirable to have a query language for tree-structured data that is (1) as easily usable as SQL, (2) as expressive as monadic second-order logic (MSO), and (3) efficiently evaluable. The paper develops some ideas in this direction. Towards (1) the specification of sets of vertices of a tree by combining conditions on their induced subtree with conditions on their path to the root is proposed. Existing query languages allow regular expressions (hence MSO logic) in path conditions but are limited in expressing subtree conditions. It is shown that such query languages fall short of capturing all MSO queries. On the other hand, allowing a certain guarded fragment of MSO-logic in the specification of subtree conditions results in a language fulfilling (2), (3) and, anguably, (1).

[1]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[2]  Wolfgang Thomas.  Logical Aspects in the Study of Tree Languages , 1984, CAAP.

[3]  Wolfgang Thomas.  On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees , 1987, LICS.

[4]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[5]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[6]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[7]  Nils Klarlund,et al.  Mona & Fido: The Logic-Automaton Connection in Practice , 1997, CSL.

[8]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.

[9]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, J. Comput. Syst. Sci..

[10]  Sophie Cluet,et al.  Your mediators need data conversion! , 1998, SIGMOD '98.

[11]  Wenfei Fan,et al.  Path constraints on semistructured and structured data , 1998, PODS '98.

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

[13]  Alin Deutsch,et al.  A Query Language for XML , 1999, Comput. Networks.

[14]  Dan Suciu,et al.  Catching the boat with Strudel: experiences with a Web-site management system , 1998, SIGMOD '98.

[15]  Dan Suciu,et al.  Semistructured Data and XML , 2001, FODO.

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

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

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

[19]  Diego Calvanese,et al.  Rewriting of regular expressions and regular path queries , 1999, PODS '99.

[20]  Yannis Papakonstantinou,et al.  DTD inference for views of XML data , 2000, PODS.

[21]  Alberto O. Mendelzon,et al.  Research Issues in Structured and Semistructured Database Programming , 1999, Lecture Notes in Computer Science.