Designing information-preserving mapping schemes for XML

Denilson Barbosa, Juliana Freire, Alberto O. Mendelzon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An XML-to-relational mapping scheme consists of a procedure for shredding documents into relational databases, a procedure for publishing databases back as documents, and a set of constraints the databases must satisfy. In previous work, we defined two notions of information preservation for mapping schemes: losslessness, which guarantees that any document can be reconstructed from its corresponding database; and validation, which requires every legal database to correspond to a valid document. We also described one information-preserving mapping scheme, called Edge ++, and showed that, under reasonable assumptions, losslessness and validation are both undecidable. This leads to the question we study in this paper: how to design mapping schemes that are information-preserving. We propose to do it by starting with a scheme known to be information-preserving and applying to it equivalence-preserving transformations written in weakly recursive ILOG. We study an instance of this framework, the LILO algorithm, and show that it provides significant performance improvements over Edge ++ and introduces constraints that are efficiently enforced in practice.

Original languageEnglish (US)
Title of host publicationVLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases
Pages109-120
Number of pages12
Volume1
StatePublished - 2005
EventVLDB 2005 - 31st International Conference on Very Large Data Bases - Trondheim, Norway
Duration: Aug 30 2005Sep 2 2005

Other

OtherVLDB 2005 - 31st International Conference on Very Large Data Bases
CountryNorway
CityTrondheim
Period8/30/059/2/05

Fingerprint

XML

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Barbosa, D., Freire, J., & Mendelzon, A. O. (2005). Designing information-preserving mapping schemes for XML. In VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases (Vol. 1, pp. 109-120)

Designing information-preserving mapping schemes for XML. / Barbosa, Denilson; Freire, Juliana; Mendelzon, Alberto O.

VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. Vol. 1 2005. p. 109-120.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Barbosa, D, Freire, J & Mendelzon, AO 2005, Designing information-preserving mapping schemes for XML. in VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. vol. 1, pp. 109-120, VLDB 2005 - 31st International Conference on Very Large Data Bases, Trondheim, Norway, 8/30/05.
Barbosa D, Freire J, Mendelzon AO. Designing information-preserving mapping schemes for XML. In VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. Vol. 1. 2005. p. 109-120
Barbosa, Denilson ; Freire, Juliana ; Mendelzon, Alberto O. / Designing information-preserving mapping schemes for XML. VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. Vol. 1 2005. pp. 109-120
@inproceedings{61270f625b984985818576084721a14f,
title = "Designing information-preserving mapping schemes for XML",
abstract = "An XML-to-relational mapping scheme consists of a procedure for shredding documents into relational databases, a procedure for publishing databases back as documents, and a set of constraints the databases must satisfy. In previous work, we defined two notions of information preservation for mapping schemes: losslessness, which guarantees that any document can be reconstructed from its corresponding database; and validation, which requires every legal database to correspond to a valid document. We also described one information-preserving mapping scheme, called Edge ++, and showed that, under reasonable assumptions, losslessness and validation are both undecidable. This leads to the question we study in this paper: how to design mapping schemes that are information-preserving. We propose to do it by starting with a scheme known to be information-preserving and applying to it equivalence-preserving transformations written in weakly recursive ILOG. We study an instance of this framework, the LILO algorithm, and show that it provides significant performance improvements over Edge ++ and introduces constraints that are efficiently enforced in practice.",
author = "Denilson Barbosa and Juliana Freire and Mendelzon, {Alberto O.}",
year = "2005",
language = "English (US)",
isbn = "1595931546",
volume = "1",
pages = "109--120",
booktitle = "VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases",

}

TY - GEN

T1 - Designing information-preserving mapping schemes for XML

AU - Barbosa, Denilson

AU - Freire, Juliana

AU - Mendelzon, Alberto O.

PY - 2005

Y1 - 2005

N2 - An XML-to-relational mapping scheme consists of a procedure for shredding documents into relational databases, a procedure for publishing databases back as documents, and a set of constraints the databases must satisfy. In previous work, we defined two notions of information preservation for mapping schemes: losslessness, which guarantees that any document can be reconstructed from its corresponding database; and validation, which requires every legal database to correspond to a valid document. We also described one information-preserving mapping scheme, called Edge ++, and showed that, under reasonable assumptions, losslessness and validation are both undecidable. This leads to the question we study in this paper: how to design mapping schemes that are information-preserving. We propose to do it by starting with a scheme known to be information-preserving and applying to it equivalence-preserving transformations written in weakly recursive ILOG. We study an instance of this framework, the LILO algorithm, and show that it provides significant performance improvements over Edge ++ and introduces constraints that are efficiently enforced in practice.

AB - An XML-to-relational mapping scheme consists of a procedure for shredding documents into relational databases, a procedure for publishing databases back as documents, and a set of constraints the databases must satisfy. In previous work, we defined two notions of information preservation for mapping schemes: losslessness, which guarantees that any document can be reconstructed from its corresponding database; and validation, which requires every legal database to correspond to a valid document. We also described one information-preserving mapping scheme, called Edge ++, and showed that, under reasonable assumptions, losslessness and validation are both undecidable. This leads to the question we study in this paper: how to design mapping schemes that are information-preserving. We propose to do it by starting with a scheme known to be information-preserving and applying to it equivalence-preserving transformations written in weakly recursive ILOG. We study an instance of this framework, the LILO algorithm, and show that it provides significant performance improvements over Edge ++ and introduces constraints that are efficiently enforced in practice.

UR - http://www.scopus.com/inward/record.url?scp=33645016596&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645016596&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1595931546

SN - 9781595931542

VL - 1

SP - 109

EP - 120

BT - VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases

ER -