Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Approximate tree matching in the presence of variable length don't cares
Journal of Algorithms
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reconciling schemas of disparate data sources: a machine-learning approach
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XClust: clustering XML schemas for effective integration
Proceedings of the eleventh international conference on Information and knowledge management
A survey of software reuse libraries
Annals of Software Engineering
Identification of Syntactically Similar DTD Elements for Schema Matching
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
Comparison of Schema Matching Evaluations
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Extended gloss overlaps as a measure of semantic relatedness
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Matching large schemas: Approaches and evaluation
Information Systems
PORSCHE: Performance ORiented SCHEma mediation
Information Systems
A model for matching and integrating heterogeneous relational biomedical databases schemas
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Integrating schemas of heterogeneous relational databases through schema matching
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Approximate common structures in XML schema matching
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Towards a More Scalable Schema Matching: A Novel Approach
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
XML Schema is becoming an indispensable component in developing web applications. With its widespread adoption and its web accessibility, XML Schema reuse is becoming imperative. To support XML Schema reuse, the first step is to develop mechanism to search for relevant XML Schemas over the web. This paper describes a XML Schema matching system that compares two XML Schemas. Our matching system can find accurate matches and scales to large XML Schemas with hundreds of elements. In this system, XML Schemas are modelled as labeled, unordered and rooted trees, and a new tree matching algorithm is developed. Compared with the tree edit-distance algorithm and other schema matching systems, it is faster and more suitable for XML Schema matching.