XML is widely used for data exchange between relational databases. Generic exchange tools are based on mappings between the elements of both schemas. Despite the benefits of using generic tools, the manual definition of the mappings can become a time consuming and error-prone task. Given this scenario we propose algorithms for the automatic matching of XML schemas(DTDs) and relational schemas. Considering we restricted the schemas formats allowed for DTDs and relational schemas, the algorithms(matchers) we proposed take advantage of the particularities of each schema to provide a more precise matching than the other solutions available. We also assess the effectiveness of our matchers running experiments using real world schemas on the movies domain.
Sergio L. S. Mergen, Carlos A. Heuser