The Community for Technology Leaders
Green Image
Issue No. 02 - April-June (2013 vol. 6)
ISSN: 1939-1374
pp: 201-213
M. Pantazoglou , Dept. of Inf. & Telecommun., Nat. & Kapodistrian Univ. of Athens, Athens, Greece
A. Tsalgatidou , Dept. of Inf. & Telecommun., Nat. & Kapodistrian Univ. of Athens, Athens, Greece
ABSTRACT
In this paper, we propose Proteus, a generic query model for the discovery of operations offered by heterogeneous services. We demonstrate the need for such a model, and show how it unifies the task of service discovery through abstractions, which allow for the technology-independent formulation of service advertisements, queries, and query responses. On top of these generic elements, we build an intuitive, fuzzy-based query evaluation mechanism that supports the service matchmaking process by employing and appropriately combining existing similarity metrics. Thanks to the generality of Proteus, it is possible to seamlessly accommodate the discovery of operations provided by various types of services without the need of changing the existing service infrastructure. Thus, our approach is applicable to a variety of settings ranging from traditional web services to service-oriented grids, peer-to-peer networks, geospatial information systems, and so on. Overall, compared to the existing query models supported by standard service discovery technologies, our approach is marked by openness, flexibility, and improved performance in terms of precision and recall. The feasibility and efficiency of Proteus are verified by a series of experiments.
INDEX TERMS
Web services, Semantics, Computational modeling, Query processing, Variable speed drives, Peer to peer computing, Ontologies, metadata of services interfaces, Services discovery process and methodology, web services interoperability
CITATION
M. Pantazoglou, A. Tsalgatidou, "A Generic Query Model for the Unified Discovery of Heterogeneous Services", IEEE Transactions on Services Computing, vol. 6, no. , pp. 201-213, April-June 2013, doi:10.1109/TSC.2011.47
99 ms
(Ver )