摘要
为解决Web服务间的自适应调用关联问题,从服务间的逻辑调用关系出发,提出一种Web服务隐式逻辑关联图的构造方法。在该方法中,Web服务被简化为三元组,给定的Web服务集对应的三元关系集可分解为输出子项集和输入子项集两个简单的二元关系。服务链是输出子项集和输入子项集连接运算的结果,构成Web服务关联图的边。给出了子项集的构造算法和Web服务关联图的构造算法,并进行了相关实验。实验证明了所提方法的有效性。
To solve the adaptive invoking problem of Web service implicit relationship,a constructing method for Web services implicit relationship graph from the perspectives of the invoking logics was proposed.In this method,Web service was simplified as a tri-tuple.The triple relationships corresponding to a set of Web services were decomposed into two types of binary relationships： output patterns set and input pattern set.Services links were the edges of Web services implicit relationship graph and was the result from the linking operation of output patterns set and input pattern set.Algorithms of constructing the pattern set and Web services implicit relationship graph were put forward.The effectiveness of the proposed method was verified by experiment.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2011年第8期1670-1676,共7页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(90818004)
教育部新世纪优秀人才支持计划资助项目(NCET-10-0140)
湖南省科技计划资助项目(2010CK3049)
湖南省教育厅科研资助项目(10C0094
09K085)
湖南省杰出青年基金资助项目(11JJ1011)~~
关键词
WEB服务
隐式关联
关联图
逻辑关系
Web services
implicit linked
implicit relationship graph
logic relationship
