ABSTRACT
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.
- ]]S. Abiteboul, L. Segoufin, V. Vianu. Representing and querying XML with incomplete information. In PODS'01, pages 150--161. Google Scholar
Digital Library
- ]]S. Amer-Yahia, S. Cho, L. Lakshmanan, D. Srivastava. Tree pattern query minimization. VLDB J. 11 (2002), 315--331. Google Scholar
Digital Library
- ]]M. Arenas, L. Libkin. A normal form for XML documents. ACM TODS 29 (2004), 195--232. Google Scholar
Digital Library
- ]]M. Arenas, L. Libkin. XML data exchange: consistency and query answering. J. ACM 55(2): (2008). Google Scholar
Digital Library
- ]]M. Arenas, J. Perez, C. Riveros. The recovery of a schema mapping: bringing exchanged data back. PODS'08, pages 13--22. Google Scholar
Digital Library
- ]]D. Barbosa, J. Freire, A. Mendelzon. Designing information-preserving mapping schemes for XML. In VLDB'05, pages 109--120. Google Scholar
Digital Library
- ]]M. Benedikt, W. Fan, F. Geerts. XPath satisfiability in the presence of DTDs. J. ACM 55(2): (2008). Google Scholar
Digital Library
- ]]P. Bernstein, T.Green, S. Melnik, A. Nash. Implementing mapping composition. VLDB'06, pages 55--66. Google Scholar
Digital Library
- ]]P. Bernstein, S. Melnik. Model management 2.0: manipulating richer mappings. SIGMOD'07, pages 1--12. Google Scholar
Digital Library
- ]]G.J. Bex, F. Neven, J. Van den Bussche. DTDs versus XML Schema: a practical study. WebDB'04, pages 79--84. Google Scholar
Digital Library
- ]]M. Bojanczyk, C. David, A. Muscholl, Th. Schwentick, L. Segoufin. Two-variable logic on data trees and XML reasoning. In PODS'06, pages 10--19. Google Scholar
Digital Library
- ]]H. Bjorklund, W. Martens, T. Schwentick. Conjunctive query containment over trees. DBPL'07, pages 66--80. Google Scholar
Digital Library
- ]]H. Bjorklund, W. Martens, T. Schwentick. Optimizing conjunctive queries over trees using schema information. MFCS'08, pages 132--143. Google Scholar
Digital Library
- ]]L. Chiticariu, W.C. Tan. Debugging schema mappings with routes. In VLDB'06, pages 79--90. Google Scholar
Digital Library
- ]]C. David. Complexity of data tree patterns over XML documents. In MFCS'08, pages 278--289. Google Scholar
Digital Library
- ]]R. Fagin, Ph. Kolaitis, R. Miller, L. Popa. Data exchange: semantics and query answering. TCS 336 (2005), 89--124. Google Scholar
Digital Library
- ]]R. Fagin, Ph. Kolaitis, L. Popa, W.C. Tan. Composing schema mappings: second-order dependencies to the rescue. ACM TODS 30(4) 994--1055 (2005). Google Scholar
Digital Library
- ]]R. Fagin, Ph. Kolaitis, L. Popa, W.C. Tan. Quasi-inverses of schema mappings. ACM TODS 33(2): (2008). Google Scholar
Digital Library
- ]]W. Fan, P. Bohannon. Information preserving XML schema embedding. ACM TODS 33(1) (2008). Google Scholar
Digital Library
- ]]W. Fan, L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM 49 (2002), 368--406. Google Scholar
Digital Library
- ]]G. Gottlob, C. Koch, K. Schulz. Conjunctive queries over trees. J. ACM 53 (2006), 238--272. Google Scholar
Digital Library
- ]]J. Hidders. Satisfiability of XPath expressions. In DBPL'03, pages 21--36.Google Scholar
- ]]Ph. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS 2005, pages 61--75. Google Scholar
Digital Library
- ]]Ph. Kolaitis, J. Panttaja, W.C. Tan. The complexity of data exchange. In PODS 2006, pages 30--39. Google Scholar
Digital Library
- ]]M. Lenzerini. Data integration: a theoretical perspective. In PODS'02, pages 233--246. Google Scholar
Digital Library
- ]]H. Lewis. Complexity results for classes of quantificational formulas. JCSS 21 (1980), 317--353.Google Scholar
Cross Ref
- ]]J. Madhavan, A. Halevy. Composing mappings among data sources. In VLDB'03, pages 572--583. Google Scholar
Digital Library
- ]]S. Melnik, H. Garcia-Molina, E. Rahm. Similarity flooding: a versatile graph matching algorithm. In ICDE'02, pages 117--128. Google Scholar
Digital Library
- ]]R. Miller, M. Hernandez, L. Haas, L. Yan, C. Ho, R. Fagin, L. Popa. The Clio project: managing heterogeneity. SIGMOD Record 30 (2001), 78--83. Google Scholar
Digital Library
- ]]T. Milo and S. Zohar. Using schema matching to simplify heterogeneous data translation. In VLDB'98, pages 122--133. Google Scholar
Digital Library
- ]]A. Nash, P. Bernstein, S. Melnik. Composition of mappings given by embedded dependencies. ACM TODS 32(1): 4 (2007). Google Scholar
Digital Library
- ]]L. Popa, Y. Velegrakis, R. Miller, M. Hernandez, R. Fagin. Translating web data. In VLDB 2002}, pages 598--609. Google Scholar
Digital Library
- ]]L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL'06, pages 41--57. Google Scholar
Digital Library
Index Terms
XML schema mappings
Recommendations
XML Schema Mappings: Data Exchange and Metadata Management
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 ...
The consistency and absolute consistency problems of XML schema mappings between restricted DTDs
Consistency of XML schema mappings, which means that some document conforming to the source schema can be mapped into a document conforming to the target schema, is an essentially necessary property. It is also important for XML schema mappings to be ...
Composing schema mappings: Second-order dependencies to the rescue
Special Issue: SIGMOD/PODS 2004A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). A fundamental problem is composing schema mappings: given ...






Comments