An efficient parallel algorithm that finds independent sets of guaranteed size
SIAM Journal on Discrete Mathematics
WordNet: a lexical database for English
Communications of the ACM
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference 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
XML Mapping technology: making connections in an XML-centric world
IBM Systems Journal
Web service discovery and dynamic invocation based on UDDI/OWL-S
BPM'05 Proceedings of the Third international conference on Business Process Management
An agent based network resource planner for workflow applications
Multiagent and Grid Systems - Agent Based Computing: From Model to Implementation
| Hi-index | 0.00 |
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema matching and apply it to the API schemas constituting the I/O descriptions of services. The algorithm assures an optimal match of corresponding entities by obtaining a maximum matching in a bi-partite graph formed from the attributes.