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

Authors:
Nobutaka Suzuki
Affiliations:
University of Tsukuba, Ibaraki, Japan
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 13
Cited 8

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Change detection in hierarchically structured information

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Meaningful change detection in structured data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data on the Web: from relations to semistructured data and XML

Data on the Web: from relations to semistructured data and XML
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
XClust: clustering XML schemas for effective integration

Proceedings of the eleventh international conference on Information and knowledge management
Incremental Validation of XML Documents

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Comparing Hierarchical Data in External Memory

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Xyleme: A Dynamic Warehouse for XML Data of the Web

IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Detecting Changes in XML Documents

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
An abstraction-based approach to measuring the structural similarity between two unordered XML documents

ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications

Information Systems - Special issue on web data integration

XIS: an XML document integration system

Proceedings of the 2005 ACM symposium on Document engineering
Computing edit distances between an XML document and a schema and its application in document classification

Proceedings of the 2006 ACM symposium on Applied computing
XML schema clustering with semantic and hierarchical similarity measures

Knowledge-Based Systems
An agent framework for recommendation

TELE-INFO'07 Proceedings of the 6th WSEAS Int. Conference on Telecommunications and Informatics
Xdiff+: a visualization system for XML documents and Schemata

Proceedings of the 46th Annual Southeast Regional Conference on XX
Clustering XML documents based on structural similarity

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Fast approximate matching between XML documents and schemata

APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
On repairing structural problems in semi-structured data

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding an optimum edit script between data plays an important role in data retrieval and data transformation. Many methods for finding an optimum edit script between two XML documents have been proposed so far, but few studies on finding an optimum edit script between an XML document and a DTD have been made. In this paper, we first show a polynomial-time algorithm that finds an optimum edit script between an XML document (modeled as an ordered tree) and a DTD. We next prove that, if the cost of an operation on a node in a tree may depend on the other nodes, then the corresponding decision problem becomes strongly NP-complete.