Computing Service Skycube for Web Service Selection

Research ers in service computing area introduce the service Skyline to optimize web service selection. It can eliminate those low-quality web services for large amounts of candidates and return a much smaller and high-quality set to the user. But there is one obvious limitation for these work that they can only compute Skyline on one combination of QoWS parameters. However, in practical, ditTerent users may be interested in different combinations of QoWS parameters, and existing work cannot atTord such requirement for ditTerent QoWS preference. In this paper, we introduce the service Skycube which consists of Skyline on all possible combinations of QoWS parameters. As it is computed previously in otT-line manner, using Skycube can speed up the response time in real-time web service selection. Unfortunately, the current Skycbue computation solutions suffer from the issue of dimension scalability. To overcome this problem, in this paper, the computational relationship between Skyline computation on one subspace and its super-space are studied. Then a novel computational model, which can compute Skyline on related subs paces by reusing the duplicate comparison results, is developed. Based on this model, a Column-sorting based Skycube computation algorithm, called CSBSC, is proposed to compute Skycube much more efficiently. The simulations demonstrate the efficiency and scalability of our CSBSC.