On inferring an XML document transformation algorithm from an edit script between DTDs (ディペンダブル コンピューティング)
スポンサーリンク
概要
- 論文の詳細を見る
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 one 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 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.
- 社団法人電子情報通信学会の論文
- 2007-10-08
著者
-
SUZUKI Nobutaka
Graduate School of Library, Information and Media Studies, University of Tsukuba
-
Fukushima Yuji
Graduate School Of Library Information And Media Studies University Of Tsukuba
-
Suzuki Nobutaka
Graduate School Of Information Science Nara Institute Of Science And Technology
関連論文
- An Algorithm for Inferring K Optimum Transformations of XML Document from Update Script to DTD
- An XML Transformation Algorithm Inferred from an Update Script between DTDs
- A Polynomial-Time Algorithm for Merging Structured Documents(Contents Technology and Web Information Systems)
- On inferring an XML document transformation algorithm from an edit script between DTDs (データ工学)
- On inferring an XML document transformation algorithm from an edit script between DTDs (ディペンダブル コンピューティング)
- Specialization Constraints for a Complex Object Model Supporting Selective Inheritance
- On Finding an Edit Script between an XML Document and a DTD
- An Edit Operation-Based Approach to the Inclusion Problem for DTDs
- An Edit Operation-Based Approach to the Inclusion Problem for DTDs