一种分布式Web服务内容的匹配方法研究  

A Study on Distributed Web Service Content Matching Method

作　　者：李文清[1] 张常有[1,2] 段淑凤[2] 

机构地区：[1]北京理工大学计算机与科学技术学院,北京市智能信息技术重点实验室,北京100081 [2]石家庄铁道大学信息科学技术学院,河北石家庄050043

出　　处：《微电子学与计算机》2010年第8期14-16,共3页Microelectronics & Computer

基　　金：国家自然科学基金项目(60873209);河北省自然科学基金项目(F2009000929)

摘　　要：为了提高非结构化对等网络中Web服务查找的准确性,研究了一种基于语义的Web服务内容匹配方法.首先,为对等网络中的服务提供者设计了以功能为关键词的服务内容模型;然后,针对计算服务,建立了语义字典;最后,以对等网络中服务内容为检索对象,设计了分布式发现的节点结构,以及相应的匹配度算法.根据对算例的分析,可知匹配度在值域范围内有较好的分布性,能够满足计算服务的需要.Aimed to enhance the accuracy of Web services discovery in unstructured peer-to-peer networks. A semantic-based Web services matching method was proposed in this paper. Firstly, we designed a service content model for peer-to-peer nodes based on the functional properties. Then, we proposed a use case of computing service, and established a semantic dictionary for it. Finally, object to the service content, we designed a node structure for distributed service publishing and discovery architecture, and the matching algrithm. The analysis result of the computing case showed that the matching degree value had a reasoning distributed property in its domain, and, the matching algrithm meeted the need of the computing service.

关 键 词：语义 Web服务内容 匹配 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]