NeT & CoT: translating relational schemas to XML schemas using semantic constraints
Proceedings of the eleventh international conference on Information and knowledge management
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Rondo: a programming platform for generic model management
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Learning to match ontologies on the Semantic Web
The VLDB Journal — The International Journal on Very Large Data Bases
Discovering complex matchings across web query interfaces: a correlation mining approach
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Matching large schemas: Approaches and evaluation
Information Systems
PORSCHE: Performance ORiented SCHEma mediation
Information Systems
Automatic Extraction of Structurally Coherent Mini-Taxonomies
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
| Hi-index | 0.00 |
In this paper, we demonstrate an approach for the discovery and validation of n:m schema match in the hierarchical structures like the XML schemata. Basic idea is to propose an n:m node match between children (leaf nodes) of two matching non-leaf nodes of the two schemata. The similarity computation of the two non-leaf nodes is based upon the syntactic and linguistic similarity of the node labels supported by the similarity among the ancestral paths from nodes to the root. The n:m matching proposition is then validated with the help of the mini-taxonomies: hierarchical structures extracted from a large set of schema trees belonging to the same domain. The technique intuitively supports the collective intelligence of the domain users, indirectly collaborating for the validation of the complex match propositions.