Efficient Semantic Web Service Discovery in Centralized and P2P Environments
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Selecting skyline services for QoS-based web service composition
Proceedings of the 19th international conference on World wide web
Efficiently evaluating skyline queries on RDF databases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Analyzing the selection and dynamic composition of web services in e-commerce transactions
Proceedings of the Fifth Balkan Conference in Informatics
Coordinating the web of services for a smart home
ACM Transactions on the Web (TWEB)
| Hi-index | 0.00 |
Semantic Web service descriptions are typically multi-parameter constructs. Discovering semantically relevant services given a desirable service description is typically addressed by performing a pairwise, logic-based match between the requested and offered parameters. However, little or no attention is given to combining these partial results to compile the final list of candidate services. Instead, this is often done in an ad hoc manner, implying a priori assumptions regarding the user's preferences. In this paper, we focus on identifying the best candidate Semantic Web services given the description of a requested service. We model the problem as a skyline query, also known as the maximum vector problem, and we show how the service selection process can be performed efficiently. We consider different aspects of the service selection process, addressing both the requesters' and the providers' points of view. Experimental evaluation on real and synthetic data shows the effectiveness and efficiency of the proposed approach.