摘要
为缩小Skyline服务集,提高服务选择的效率,提出一种Skyline服务Top-k选择方法。首先,用数据推理的方式为Skyline服务的Top-k选择提供理论依据,并提出Skyline服务Top-k选择的相关命题;然后,基于这些命题,提出Skyline服务Top-k选择算法,该算法可以得到被选择可能性最大的Top-k Skyline服务集;最后,通过实验证明,该方法能有效降低服务选择的时间,而不影响服务组合的最终结果。
A Top-k selection algorithm based on Skyline service is proposed to decrease the size of Skyline services set and increase the efficiency of service selection. Firstly,the theoretical foundation of the proposed algorithm is provided by mathematical reasoning,and then some related propositions are presented; Secondly,with the proposed propositions,the Skyline service Top-k selection algorithm is put forward,which is able to obtain the Top-k Skyline service set which was most likely to be selected; Finally,the experiment is conducted to prove that the proposed algorithm is useful to decrease service selection time with no impact on service composition.
出处
《计算机应用与软件》
CSCD
2016年第11期253-257,共5页
Computer Applications and Software
