Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
The Clio project: managing heterogeneity
ACM SIGMOD Record
Towards automating of document structure transformations
Proceedings of the 2002 ACM symposium on Document engineering
Using Schema Matching to Simplify Heterogeneous Data Translation
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SMART: a tool for semantic-driven creation of complex XML mappings
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Information preserving XML schema embedding
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Impact of XML schema evolution on valid documents
Proceedings of the 7th annual ACM international workshop on Web information and data management
An edit operation-based approach to the inclusion problem for DTDs
Proceedings of the 2007 ACM symposium on Applied computing
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers
DTD-Diff: a change detection algorithm for DTDs
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Evolution of XPath lists for document data selection
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
| Hi-index | 0.00 |
Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an edit script between original and updated DTDs is available, we consider inferring a transformation algorithm, which transforms each document valid against the original DTD into a document valid against the updated DTD, from the original DTD and the edit script. We rst show a transformation algorithm inferred from a DTD and an edit script. We next show a su cient condition under which the transformation algorithm inferred from a DTD D and an edit script is unambiguous, i.e., for any document valid against D, elements to be deleted/inserted can unambiguously be determined. Finally, we show a polynomial-time algorithm for testing the su cient condition.