Towards automating of document structure transformations

Kuikka, Eila; Leinonen, Paula; Penttonen, Martti

doi:10.1145/585076.585078

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Schema matching, query discovery, and other related problems have been extensively studied, e.g., [1], [2], [11], [13]- [16], [20]. These studies except [20] consider finding an ap- propriate matching or transformation between schemas, assuming that no update script between the schemas is known.…”

Section: Related Workmentioning

confidence: 99%

An XML Transformation Algorithm Inferred from an Update Script between DTDs

Suzuki

Fukushima

2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYFinding 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.

show abstract

Section: Related Workmentioning

confidence: 99%

An XML Transformation Algorithm Inferred from an Update Script between DTDs

Suzuki

Fukushima

2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

An Algorithm for Inferring K Optimum Transformations of XML Document from Update Script to DTD

Suzuki

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYDTDs are continuously updated according to changes in the real world. Let t be an XML document valid against a DTD D, and suppose that D is updated by an update script s. In general, we cannot uniquely "infer" a transformation of t from s, i.e., we cannot uniquely determine the elements in t that should be deleted and/or the positions in t that new elements should be inserted into. In this paper, we consider inferring K optimum transformations of t from s so that a user finds the most desirable transformation more easily. We first show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Then, assuming that an update script is of length one, we show an algorithm for solving the problem, which runs in time polynomial of |D|, |t|, and K.

show abstract

Towards automating of document structure transformations

Cited by 2 publications

References 0 publications

An XML Transformation Algorithm Inferred from an Update Script between DTDs

An XML Transformation Algorithm Inferred from an Update Script between DTDs

An Algorithm for Inferring K Optimum Transformations of XML Document from Update Script to DTD

Contact Info

Product

Resources

About