Finding an optimum edit script between an XML document and a DTD

Abstract

Finding optimum and near optimum edit scripts between an XML document and a schema is essential to correcting invalid XML documents. In this paper, we consider finding K optimum edit scripts between an XML document and a regular tree grammar. We first prove that the problem is NP-hard. We next show a pseudopolynomial-time algorithm for solving the problem.

XML document-grammar comparison: related problems and applications

“…While methods for XML document validation [9,10,14,79], and XML document transformation/correction [13,21,64,84] seem related to the problem of XML document/grammar similarity, they do not produce a similarity value, but either generate a Boolean result (indicating whether a document is valid w.r.t. a given grammar), or produce a transformation script (transforming a document into another document valid w.r.t.…”

“…A few methods for document-to-grammar transformation and/or correction have been recently proposed in the literature [13,21,64,84]. An approach for identifying the edit script transforming a given XML document to another document conforming a given DTD grammar is proposed in [84].…”

“…An approach for identifying the edit script transforming a given XML document to another document conforming a given DTD grammar is proposed in [84]. An XML document is represented as an ordered labeled tree S whereas a DTD is abstracted as a triplet D=(Σ, d, l 0 ) where Σ is the set of element labels, d a mapping from Σ to a set of regular expressions over Σ, and l 0 the starting label (corresponding to the DTD root element).…”

“…Notice that the approaches in [60,64,84] are developed in the context of XML data transformation, and thus only target the transformation operations between the XML document and the (simplified) DTD grammar. They do not however address the issue of XML document/grammar similarity.…”

Approximate XML structure validation based on document–grammar tree similarity

“…less accurate methods [17]. Also, note that our XML grammar tree model considers complex declarations, including: (i) repeatable sequence expressions, (ii) repeatable alternative expressions, and (iii) recursive expressions, which have been disregarded in most existing studies, e.g., [9,32,57]. In addition, our grammar tree model is not limited to contextfree (DTD-like) grammar declarations: where the definition of an element is unique and independent of its position in the grammar; but can be used with context-sensitive (XSD-based) declarations: where identically labeled elements can have multiple definitions in different contexts in the grammar.…”