Efficient Approach to Top-k Dominating Queries on Service Selection

The top-k dominating query is an emerging technology which is used to obtain k services that dominate the highest number of services. The advantage of top-k dominating query is even more obvious in dealing with concurrent requests. In this paper, we improve the dominance-based approach that adopts top-k dominating queries to generate a solution for a given request. Based on the proposed service selection scheme, k outstanding services would be efficiently obtained by using our optimal algorithms. The experiment demonstrates that our optimal approach outperforms the previous dominance-based method and traditional method for service selection.