research-article

Solutions in XML data exchange

Authors:

Mikołaj Bojańczyk,

Leszek A. Kołodziejczyk,

Filip MurlakAuthors Info & Claims

ICDT '11: Proceedings of the 14th International Conference on Database Theory

Pages 102 - 113

https://doi.org/10.1145/1938551.1938567

Published: 21 March 2011 Publication History

Abstract

The task of XML data exchange is to restructure a document conforming to a source schema under a target schema according to certain mapping rules. The rules are typically expressed as source-to-target dependencies using various kinds of patterns, involving horizontal and vertical navigation, as well as data comparisons. The target schema imposes complex conditions on the structure of solutions, possibly inconsistent with the mapping rules. In consequence, for some source documents there may be no solutions.

We investigate three problems: deciding if all documents of the source schema can be mapped to a document of the target schema (absolute consistency), deciding if a given document of the source schema can be mapped (solution existence), and constructing a solution for a given source document (solution building).

We show that the complexity of absolute consistency is rather high in general, but within the polynomial hierarchy for bounded depth schemas. The combined complexity of solution existence and solution building behaves similarly, but the data complexity turns out to be very low.

In addition to this we show that even for much more expressive mapping rules, based on MSO definable queries, absolute consistency is decidable and data complexity of solution existence is polynomial.

References

[1]

S. Amano, L. Libkin, and F. Murlak. XML schema mappings. In PODS 2009, pages 33--42.

Digital Library

[2]

S. Amer-Yahia, S. Cho, L. Lakshmanan, D. Srivastava. Tree pattern query minimization. VLDB J. 11 (2002), 315--331.

Digital Library

[3]

M. Arenas and L. Libkin. XML data exchange: consistency and query answering. J ACM, 55(2):7:1--72, 2008.

Digital Library

[4]

M. Benedikt, W. Fan, F. Geerts. XPath satisfiability in the presence of DTDs. J. ACM 55(2): (2008).

Digital Library

[5]

P. Barceló. Logical foundations of relational data exchange. SIGMOD Record, 38(1):49--58, 2009.

Digital Library

[6]

P. A. Bernstein and S. Melnik. Model management 2.0: manipulating richer mappings. In SIGMOD, 2007.

Digital Library

[7]

H. Björklund, W. Martens, T. Schwentick. Conjunctive query containment over trees. DBPL '07, pages 66--80.

Digital Library

[8]

H. Björklund, W. Martens, T. Schwentick. Optimizing conjunctive queries over trees using schema information. MFCS'08, pages 132--143.

Digital Library

[9]

M. Bojańczyk, L. Kołodziejczyk, F. Murlak. Solutions for XML Data Exchange. Available at www.mimuw.edu.pl/~fmurlak/papers/bkm10.pdf.

[10]

C. David. Complexity of data tree patterns over XML documents. In MFCS'08, pages 278--289.

Digital Library

[11]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Date exchange: semantics and query answering. TCS, 336:89--124, 2005.

Digital Library

[12]

R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Composing schema mappings: second-order dependencies to the rescue. ACM TODS, 30(4):994--1055, 2005.

Digital Library

[13]

G. Gottlob, C. Koch, K. Schulz. Conjunctive queries over trees. J. ACM 53(2):238--272 (2006).

Digital Library

[14]

J. Hidders. Satisfiability of XPath expressions. In DBPL'03, pages 21--36.

[15]

P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS 2005, pages 61--75.

Digital Library

[16]

R. Miller, M. Hernandez, L. Haas, L. Yan, C. Ho, R. Fagin, and L. Popa. The Clio project: managing heterogeneity. SIGMOD Record, 30:78--83, 2001.

Digital Library

[17]

M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Transactions on Internet Technology, 5(4):1--45, 2005.

Digital Library

[18]

F. Neven. Automata Theory for XML Researchers. SIGMOD Record 31(3): 39--46 (2002).

Digital Library

Cited By

ISHIHARA YHAYATA TFUJIWARA T(2020)The Absolute Consistency Problem for Relational Schema Mappings with Functional DependenciesIEICE Transactions on Information and Systems10.1587/transinf.2020EDP7102E103.D:11(2278-2288)Online publication date: 1-Nov-2020
https://doi.org/10.1587/transinf.2020EDP7102
Bourhis PPuppis GRiveros CStaworko S(2016)Bounded Repairability for Regular Tree LanguagesACM Transactions on Database Systems10.1145/289899541:3(1-45)Online publication date: 30-Jun-2016
https://dl.acm.org/doi/10.1145/2898995
Tan ZZhang LWang WShi B(2013)XML data exchange with target constraintsInformation Processing and Management: an International Journal10.1016/j.ipm.2012.09.00249:2(465-483)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.ipm.2012.09.002
Show More Cited By

Index Terms

Solutions in XML data exchange

Recommendations

Solutions in XML data exchange

The task of XML data exchange is to restructure a document conforming to a source schema under a target schema according to certain mapping rules. The rules are typically expressed as source-to-target dependencies using various kinds of patterns, ...
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 ...
Model-driven rule-based mediation in XML data exchange
MDI '10: Proceedings of the First International Workshop on Model-Driven Interoperability

XML data exchange has become ubiquitous in Business to Business (B2B) collaborations. Automating as much as possible the exchange of XML data between enterprise systems is a key requirement for ensuring agile interoperability and scalability in B2B ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDT '11: Proceedings of the 14th International Conference on Database Theory

March 2011

285 pages

ISBN:9781450305297

DOI:10.1145/1938551

Program Chair:
Tova Milo
Tel Aviv University, Israel

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

EDBT/ICDT '11

EDBT/ICDT '11: EDBT/ICDT '11 joint conference

March 21 - 24, 2011

Uppsala, Sweden

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
203
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

ISHIHARA YHAYATA TFUJIWARA T(2020)The Absolute Consistency Problem for Relational Schema Mappings with Functional DependenciesIEICE Transactions on Information and Systems10.1587/transinf.2020EDP7102E103.D:11(2278-2288)Online publication date: 1-Nov-2020
https://doi.org/10.1587/transinf.2020EDP7102
Bourhis PPuppis GRiveros CStaworko S(2016)Bounded Repairability for Regular Tree LanguagesACM Transactions on Database Systems10.1145/289899541:3(1-45)Online publication date: 30-Jun-2016
https://dl.acm.org/doi/10.1145/2898995
Tan ZZhang LWang WShi B(2013)XML data exchange with target constraintsInformation Processing and Management: an International Journal10.1016/j.ipm.2012.09.00249:2(465-483)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.ipm.2012.09.002
Gheerbrant ALibkin LSirangelo C(2013)Reasoning about pattern-based XML queriesProceedings of the 7th international conference on Web Reasoning and Rule Systems10.1007/978-3-642-39666-3_2(4-18)Online publication date: 27-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39666-3_2
Murlak FOgiński MPrzybyłko M(2012)Between tree patterns and conjunctive queriesProceedings of the 37th international conference on Mathematical Foundations of Computer Science10.1007/978-3-642-32589-2_61(705-717)Online publication date: 27-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32589-2_61

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents