Résumé
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.