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
Applied Ontology
Web Semantics: Science, Services and Agents on the World Wide Web
A survey of schema-based matching approaches
Journal on Data Semantics IV
International Journal of Web and Grid Services
Acquisition of domain ontology from relational schemes based on reverse engineering
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
A Bidirectional Heuristic Search for web service composition with costs
International Journal of Web and Grid Services
Techniques for discovering correspondences between ontologies
International Journal of Web and Grid Services
A standard ontology for smart spaces
International Journal of Web and Grid Services
International Journal of Web and Grid Services
Model-driven software development of applications based on web services
International Journal of Web and Grid Services
Element similarity measures in XML schema matching
Information Sciences: an International Journal
An approach to semantic information retrieval based on natural language query understanding
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Towards a framework for weaving social networks principles into web services discovery
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Adjustable flooding-based discovery with multiple QoSs for cloud services acquisition
International Journal of Web and Grid Services
Web Semantics: Science, Services and Agents on the World Wide Web
Towards a user-centric social approach to web services composition, execution, and monitoring
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Semantic web services discovery based on I/O parameter relations
International Journal of Web and Grid Services
A Hadoop-based approach for efficient web service management
International Journal of Web and Grid Services
Towards a community-based, social network-driven framework for Web services management
Future Generation Computer Systems
A cluster-based web service discovery in MANET environments
Mobile Information 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. It is based on matching an input ontology, describing a service request, to web services descriptions at the 'syntactic level' through Web Services Description Language (WSDL) or, at the semantic level, through service ontologies described with languages such as Ontology Web Language for Services (OWL-S), Web Services Modelling Ontology (WSMO), Semantic Web Services Framework (SWSF) and Web Services Description Language Semantics (WSDL-S). The different input schemas, WSDL descriptions, Ontology Web Language (OWL) ontologies, OWL-S, WSMO, SWSF and WSDL-S components are represented in a 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 or LD) and Synonym Matcher (through the WordNet synonyms thesaurus)).