作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (13): 37-39,43. doi: 10.3969/j.issn.1000-3428.2012.13.010

• 软件技术与数据库 • 上一篇    下一篇

基于索引表和二分图的Web服务操作发现

李季辉,贾永伟   

  1. (燕山大学信息科学与工程学院,河北 秦皇岛 066004)
  • 收稿日期:2011-09-13 出版日期:2012-07-05 发布日期:2012-07-05
  • 作者简介:李季辉(1976-),男,讲师、硕士,主研方向:数据库技术;贾永伟,助教
  • 基金资助:
    国家自然科学青年基金资助项目(61103139);秦皇岛市科学技术研究发展计划基金资助项目(201101A086)

Web Service Operation Discovery Based on Index Table and Bipartite Graph

LI Ji-hui, JIA Yong-wei   

  1. (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)
  • Received:2011-09-13 Online:2012-07-05 Published:2012-07-05

摘要: 在通用的Web服务描述语言基础上,提出一种基于倒排序索引表和二分图匹配的两阶段服务操作发现方法。第1个阶段利用倒排序索引表得到相关服务,获取服务操作的输入和输出参数,用户根据需要选取期望的输出参数作为服务请求。第2个阶段采用二分图匹配方法对服务请求进行服务操作匹配,发现所需的Web服务操作。实验结果表明,该方法能提高服务发现的准确性和灵活性,并提供功能相同的备选服务操作。

关键词: 倒排序索引, 二分图, 最佳匹配, 服务操作发现, Web服务, 服务请求

Abstract: On the basis of the common Web Services Description Language(WSDL), a two stages Web service discovery method based on the keyword index table and bipartite graph is proposed. Using the inverted order index table in the first stage, related service is discovered and the input and output parameters of service are obtained. The expected output parameters based on users’ need are used as service request. In the second stage, it uses bipartite graph matching to match the service operation for the service request, and finds the required Web service operation. Experimental results show that the method not only can improve the accuracy and the flexibility of the service discovery, but also can provide alternative service operation.

Key words: inverted index, bipartite graph, best matching, service operation discovery, Web service, service request

中图分类号: