Finding an appropriate data transformation between
two schemas has been an important problem. In this
paper, assuming that an edit script between original
and updated DTDs is available, we consider inferring
a transformation algorithm, which transforms
each document valid against the original DTD into a
document valid against the updated DTD, from the
original DTD and the edit script. We first show a
transformation algorithm inferred from a DTD and
an edit script. We next show a sufficient condition
under which the transformation algorithm inferred
from a DTD D and an edit script is unambiguous,
i.e., for any document valid against D, elements
to be deleted/inserted can unambiguously be determined.
Finally, we show a polynomial-time algorithm
for testing the sufficient condition. |
| Cite as: Suzuki, N. and Fukushima, Y. (2008). An XML Document Transformation Algorithm Inferred from an Edit Script between DTDs. In Proc. Nineteenth Australasian Database Conference (ADC 2008), Wollongong, NSW, Australia. CRPIT, 75. Fekete, A. and Lin, X., Eds. ACS. 175-184. |
 (from crpit.com)
(local if available)
|