Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Detecting changes on unordered XML documents using relational databases: a schema-conscious approach
Proceedings of the 14th ACM international conference on Information and knowledge management
Extended abstract: towards verifying semistructured data
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
An XML document transformation algorithm inferred from an edit script between DTDs
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
XS3: a system for similarity evaluation in multimedia-based heterogeneous XML repositories
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Minimizing user effort in XML grammar matching
Information Sciences: an International Journal
| Hi-index | 0.00 |
The DTD of a set of XML documents may change due to many reasons such as changes to the real world events, changes to the user's requirements, and mistakes in the initial design. In this paper, we present a novel algorithm called DTD-Diff to detect the changes to DTDs that defines the structure of a set of XML documents. Such change detection tool can be useful in several ways such as maintenance of XML documents, incremental maintenance of relational schema for storing XML data, and XML schema integration. We compare DTD-Diff with existing XML change detection approaches and show that converting DTD to XML Schema (XSD) (which is in XML document format) and detecting the changes using existing XML change detection algorithms is not a feasible option. Our experimental results show that DTD-Diff is 5–325 times faster than X-Diff when it detects the changes to the XSD files. We also study the result quality of detected deltas.