| 基于邻接矩阵的Web服务组合 |
| |
| 引用本文： | 李景霞,吴国栋,钱俊彦. 基于邻接矩阵的Web服务组合[J]. 计算机工程与科学, 2015, 37(9): 1627-1631 |
| |
| 作者姓名： | 李景霞 吴国栋 钱俊彦 |
| |
| 作者单位： | ;1.安徽农业大学信息与计算机学院;2.桂林电子科技大学计算机科学与工程学院 |
| |
| 基金项目： | 安徽农业大学2014年学科骨干培育项目（编号2014XKPY 61）;安徽省科技攻关计划项目（1501031082）;国家自然科学基金资助项目（31271615） |
| |
| 摘 要： | 针对当前Web服务组合方法在动态性和算法时间复杂度方面存在的不足,提出一种基于邻接矩阵的服务组合方法,使用邻接矩阵表示服务间的顺序及并发关系,在构建抽象服务基础上由领域专家初步建立抽象服务的组合关系,利用Warshall算法计算传递闭包来判定服务请求是否可满足,同时构建动态服务组合流程。方法操作简单,Warshall算法时间复杂度为O(n3),在服务组合中有较好的实用性。
|
| 关 键 词： | Web服务 服务组合 邻接矩阵 传递闭包 Warshall算法 |
| 收稿时间： | 2014-06-12 |
| 修稿时间： | 2015-09-25 |
Adjacency matrix-based web service composition |
| |
| LI Jing xia,WU Guo dong,QIAN Jun yan. Adjacency matrix-based web service composition[J]. Computer Engineering & Science, 2015, 37(9): 1627-1631 |
| |
| Authors: | LI Jing xia WU Guo dong QIAN Jun yan |
| |
| Affiliation: | （1.School of Information and Computer,Anhui Agricultural University,Hefei 230036；2.School of Computer Scinece and Engineering,Guilin University of Electronic Science and Technology,Guilin 541004,China） |
| |
| Abstract: | Aiming at the disadvantages in dynamics and algorithm time complexity in the existing web service composition methods, we propose an adjacency matrix based web service composition approach. Sequential and parallel relationship among web services is represented by adjacency matrix. Abstract services are created by clustering, and the composition relationship among abstract services is established by domain experts. The Warshall algorithm is utilized to calculate the transitive closure of the adjacency matrix so that we can judge whether the the service request is met or not. Meanwhile the dynamic service composition flow is constructed. The proposed method applies well in service composition due to its simple operation and the O(n3) time complexity of the Warshall algorithm. |
| |
| Keywords: | web service service composition adjacency matrix transitive closure Warshall algorithm, |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
