XML schema mappings

Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amount of attention. Our goal is to develop a theory of expressive XML schema mappings. Such mappings should be able to use various forms of navigation in a document, and specify conditions on data values. We develop a language for XML schema mappings, and concentrate on three types of problems: static analysis of mappings, their complexity, and their composition. We look at static analysis problems related to various flavors of consistency: for example, whether it is possible to map some document of a source schema into a document of the target schema, or whether all documents of a source schema can be mapped. We classify the complexity of these problems. We then move to the complexity of mappings themselves, i.e., recognizing pairs of documents such that one can be mapped into the other, and provide a classification based on sets of features used in mappings. Finally we look at composition of XML schema mappings. We study its complexity and show that it is harder to achieve closure under composition for XML than for relational mappings. Nevertheless, we find a robust class of XML schema mappings that have good complexity properties and are closed under composition.

[1]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[2]  Wenfei Fan,et al.  Information preserving XML schema embedding , 2005, TODS.

[3]  Claire David,et al.  Complexity of Data Tree Patterns over XML Documents , 2008, MFCS.

[4]  Ronald Fagin,et al.  Quasi-inverses of schema mappings , 2008, ACM Trans. Database Syst..

[5]  Michael Benedikt,et al.  XPath satisfiability in the presence of DTDs , 2008, JACM.

[6]  李幼升,et al.  Ph , 1989 .

[7]  Ronald Fagin,et al.  Translating Web Data , 2002, VLDB.

[8]  Laura M. Haas,et al.  The Clio project: managing heterogeneity , 2001, SGMD.

[9]  Erhard Rahm,et al.  Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.

[10]  Serge Abiteboul,et al.  Representing and querying XML with incomplete information , 2006, TODS.

[11]  Denilson Barbosa,et al.  Designing Information-Preserving Mapping Schemes for XML , 2005, VLDB.

[12]  Thomas Schwentick,et al.  Conjunctive Query Containment over Trees , 2007, DBPL.

[13]  Phokion G. Kolaitis,et al.  The complexity of data exchange , 2006, PODS '06.

[14]  Georg Gottlob,et al.  Conjunctive queries over trees , 2004, JACM.

[15]  Thomas Schwentick,et al.  Conjunctive query containment over trees , 2011, J. Comput. Syst. Sci..

[16]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[17]  Jan Hidders.  Satisfiability of XPath Expressions , 2003, DBPL.

[18]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

[19]  Wang Chiew Tan,et al.  Debugging schema mappings with routes , 2006, VLDB.

[20]  Ronald Fagin,et al.  Quasi-inverses of schema mappings , 2007, PODS '07.

[21]  Marcelo Arenas,et al.  XML data exchange: consistency and query answering , 2005, PODS '05.

[22]  Ronald Fagin,et al.  Composing schema mappings: second-order dependencies to the rescue , 2004, PODS '04.

[23]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[24]  Ronald Fagin,et al.  Composing schema mappings: second-order dependencies to the rescue , 2004, PODS 2004.

[25]  Wenfei Fan,et al.  On XML integrity constraints in the presence of DTDs , 2001, JACM.

[26]  Laks V. S. Lakshmanan,et al.  Tree pattern query minimization , 2002, The VLDB Journal.

[27]  Philip A. Bernstein,et al.  Model management 2.0: manipulating richer mappings , 2007, SIGMOD '07.

[28]  Philip A. Bernstein,et al.  Composition of mappings given by embedded dependencies , 2005, PODS '05.

[29]  Jayant Madhavan,et al.  Composing Mappings Among Data Sources , 2003, VLDB.

[30]  Philip A. Bernstein,et al.  Implementing mapping composition , 2007, The VLDB Journal.

[31]  Frank Neven,et al.  DTDs versus XML schema: a practical study , 2004, WebDB '04.

[32]  Tova Milo,et al.  Using Schema Matching to Simplify Heterogeneous Data Translation , 1998, VLDB.

[33]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2005, Theor. Comput. Sci..

[34]  Marcelo Arenas,et al.  A normal form for XML documents , 2004, TODS.

[35]  Thomas Schwentick,et al.  Optimizing Conjunctive Queries over Trees Using Schema Information , 2008, MFCS.

[36]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

[37]  Phokion G. Kolaitis.  Schema mappings, data exchange, and metadata management , 2005, PODS '05.