首页 | 本学科首页   官方微博 | 高级检索  
     

质量驱动的Web服务Top-K查询
引用本文:金侠,杨卫东. 质量驱动的Web服务Top-K查询[J]. 计算机工程, 2010, 36(20): 58-60
作者姓名:金侠  杨卫东
作者单位:复旦大学计算机科学技术学院,上海,200433
基金项目:上海市基础研究基金资助重点项目 
摘    要:在Web服务发现领域中,引入Top-K查询且同时考虑服务质量的研究相对较少。针对这种情况,提出一种重点考虑质量的Web服务Top-K查询方案。在该方案中,规范化服务的质量数据,给出质量评价函数,根据质量定义服务之间的从属关系,并且改进传统Top-K查询的门槛算法,提出收敛速度更快的StopLine算法。实验表明,该算法能更快地得到前K个服务,效果良好。

关 键 词:Web服务发现  服务质量  Top-K查询

Quality-driven Top-K Query of Web Services
JIN Xia,YANG Wei-dong. Quality-driven Top-K Query of Web Services[J]. Computer Engineering, 2010, 36(20): 58-60
Authors:JIN Xia  YANG Wei-dong
Affiliation:(School of Computer Science, Fudan University, Shanghai 200433, China)
Abstract: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.
Keywords:Web services discovery  Quality of Service(QoS)  Top-K query
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号