Australian Computer Society
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 (Document Type Definitions) is available, the authors 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. They first show a transformation algorithm inferred from a DTD and an edit script. They 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.