The search functionality is under construction.

The search functionality is under construction.

Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an update script between original and updated DTDs is available, we consider inferring a transformation algorithm from the original DTD and the update script such that the algorithm transforms each document valid against the original DTD into a document valid against the updated DTD. We first show a transformation algorithm inferred from a DTD and an update script. We next show a sufficient condition under which the transformation algorithm inferred from a DTD *d* and an update script is unambiguous, i.e., for any document *t* valid against *d*, elements to be deleted/inserted can unambiguously be determined. Finally, we show a polynomial-time algorithm for testing the sufficient condition.

- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.4 pp.594-607

- Publication Date
- 2009/04/01

- Publicized

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.E92.D.594

- Type of Manuscript
- PAPER

- Category
- Database

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Nobutaka SUZUKI, Yuji FUKUSHIMA, "An XML Transformation Algorithm Inferred from an Update Script between DTDs" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 4, pp. 594-607, April 2009, doi: 10.1587/transinf.E92.D.594.

Abstract: Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an update script between original and updated DTDs is available, we consider inferring a transformation algorithm from the original DTD and the update script such that the algorithm transforms each document valid against the original DTD into a document valid against the updated DTD. We first show a transformation algorithm inferred from a DTD and an update script. We next show a sufficient condition under which the transformation algorithm inferred from a DTD *d* and an update script is unambiguous, i.e., for any document *t* valid against *d*, elements to be deleted/inserted can unambiguously be determined. Finally, we show a polynomial-time algorithm for testing the sufficient condition.

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.594/_p

Copy

@ARTICLE{e92-d_4_594,

author={Nobutaka SUZUKI, Yuji FUKUSHIMA, },

journal={IEICE TRANSACTIONS on Information},

title={An XML Transformation Algorithm Inferred from an Update Script between DTDs},

year={2009},

volume={E92-D},

number={4},

pages={594-607},

abstract={Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an update script between original and updated DTDs is available, we consider inferring a transformation algorithm from the original DTD and the update script such that the algorithm transforms each document valid against the original DTD into a document valid against the updated DTD. We first show a transformation algorithm inferred from a DTD and an update script. We next show a sufficient condition under which the transformation algorithm inferred from a DTD *d* and an update script is unambiguous, i.e., for any document *t* valid against *d*, elements to be deleted/inserted can unambiguously be determined. Finally, we show a polynomial-time algorithm for testing the sufficient condition.},

keywords={},

doi={10.1587/transinf.E92.D.594},

ISSN={1745-1361},

month={April},}

Copy

TY - JOUR

TI - An XML Transformation Algorithm Inferred from an Update Script between DTDs

T2 - IEICE TRANSACTIONS on Information

SP - 594

EP - 607

AU - Nobutaka SUZUKI

AU - Yuji FUKUSHIMA

PY - 2009

DO - 10.1587/transinf.E92.D.594

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E92-D

IS - 4

JA - IEICE TRANSACTIONS on Information

Y1 - April 2009

AB - Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an update script between original and updated DTDs is available, we consider inferring a transformation algorithm from the original DTD and the update script such that the algorithm transforms each document valid against the original DTD into a document valid against the updated DTD. We first show a transformation algorithm inferred from a DTD and an update script. We next show a sufficient condition under which the transformation algorithm inferred from a DTD *d* and an update script is unambiguous, i.e., for any document *t* valid against *d*, elements to be deleted/inserted can unambiguously be determined. Finally, we show a polynomial-time algorithm for testing the sufficient condition.

ER -