Describing and Quering Semistructured Data: Some Expressiveness Results

Data in traditional relational and object-oriented databases is highly structured and subject to explicit schemas.The aim of the present contribution is to map new languages for semistructured data to well-studied formal languages and by doing so characterise their complexity and expressive power.

[1]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

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

[3]  Johan van Benthem,et al.  Handbook of Logic and Language , 1996 .

[4]  Serge Abiteboul,et al.  Querying Semi-Structured Data , 1997, Encyclopedia of Database Systems.

[5]  Roy Goldman,et al.  DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases , 1997, VLDB.

[6]  William C. Rounds,et al.  Feature Logics , 1997, Handbook of Logic and Language.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Dan Suciu,et al.  Adding Structure to Unstructured Data , 1997, ICDT.

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

[10]  Neil Immerman,et al.  Model Checking and Transitive-Closure Logic , 1997, CAV.