Presentation	2005-06-17 Finding an Optimum Edit Script between an XML Document and a Regular Tree Grammar Nobutaka SUZUKI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	So far many algorithms for finding an optimum edit script between two XML documents have been proposed, but few studies on finding an optimum edit script between an XML document and a schema have been made. In this paper, we employ regular tree grammar as a schema language and propose a polynomial-time algorithm for finding an optimum edit script between an XML document and a regular tree grammar, i.e., an edit script that optimally transforms the (invalid) XML document into a valid one against the grammar.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	XML / regular tree grammar / data transformation / optimum edit script
Paper #	DE2005-25,PRMU2005-46
Date of Issue

Conference Information
Committee	DE
Conference Date	2005/6/10(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Data Engineering (DE)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Finding an Optimum Edit Script between an XML Document and a Regular Tree Grammar
Sub Title (in English)
Keyword(1)	XML
Keyword(2)	regular tree grammar
Keyword(3)	data transformation
Keyword(4)	optimum edit script
1st Author's Name	Nobutaka SUZUKI
1st Author's Affiliation	Graduate School of Library, Information and Media Studies University of Tsukuba()
Date	2005-06-17
Paper #	DE2005-25,PRMU2005-46
Volume (vol)	vol.105
Number (no)	117
Page	pp.pp.-
#Pages	6
Date of Issue