Semantic integration of semistructured and structured data sources
ACM SIGMOD Record
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
Semantic and schematic similarities between database objects: a context-based approach
The VLDB Journal — The International Journal on Very Large Data Bases
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Semi-Automatic, Semantic Discovery of Properties from Database Schemes
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
The PROMPT suite: interactive tools for ontology merging and mapping
International Journal of Human-Computer Studies
Ontology mapping: the state of the art
The Knowledge Engineering Review
The Knowledge Engineering Review
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Web Semantics: Science, Services and Agents on the World Wide Web
Automatic composition of Learning Grid Portlets: a comparison of syntactic and semantic approaches
International Journal of Grid and Utility Computing
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
A taxonomy and classification of web service QoS elements
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
In this paper we present an approach to semantic based Web Service discovery, and a prototypical tool, based on syntactic and structural schema matching, among an input ontology, describing a service request, and web services descriptions, at the “syntactic level” through WSDL, or at the semantic level, through service ontologies included in OWL-S, WSMO, SWSF and WSDL-S. The different input schema, WSDL descriptions, OWL ontologies, OWL-S, WSMO, SWSF and WSDL-S components, are represented in an uniform way by means of directed rooted graphs, where nodes represent schema elements, connected by directed links of different types, e.g. for containment and referential relationships. On this uniform internal representation a number of matching algorithms operate, including structural based algorithms (Children Matcher, Leaves Matcher, Graph and SubGraph Isomorphism) and syntactical ones (Edit Distance (Levenshtein Distance) and Synonym Matcher (through WordNet synonyms thesaurus).