An Edit Operation-Based Approach to the Inclusion Problem for DTDs
スポンサーリンク
概要
- 論文の詳細を見る
XML documents on a database should be revalidated whenever a DTD is updated, since the documents may no longer be valid against the DTD. Solving the inclusion problem for DTDs is essential to avoiding such an expensive revalidation, but the problem is shown to be PSPACE-complete. In this paper, we propose a subproblem of the inclusion problem in terms of edit operations to regular expressions, and show a polynomial-time algorithm for solving the subproblem. Then we consider the recognizability of the algorithm.
- 一般社団法人電子情報通信学会の論文
- 2006-10-11
著者
-
Suzuki Nobutaka
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 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