摘要
在Web服务发现领域中,引入Top-K查询且同时考虑服务质量的研究相对较少。针对这种情况,提出一种重点考虑质量的Web服务Top-K查询方案。在该方案中,规范化服务的质量数据,给出质量评价函数,根据质量定义服务之间的从属关系,并且改进传统Top-K查询的门槛算法,提出收敛速度更快的StopLine算法。实验表明,该算法能更快地得到前K个服务,效果良好。
In the current research area on Web services discovery,solutions with Top-K query and taking the quality of services into account meanwhile are not common.In the view of the situation,this paper presents a solution for Top-K Web services,focusing on the quality of services.The quality data of services are normalized,the quality evaluation function is given,and the dominance relationship between services is defined.Especially,the typical threshold algorithm is improved to propose StopLine algorithm to get Top-K Web services,which converges faster.The algorithm is proved to be more efficient in the experiment.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第20期58-60,共3页
Computer Engineering
基金
上海市基础研究基金资助重点项目(08JC1402500)
