基于图匹配的组合算法和普通组合算法的比较实

摘   要
Web应用的巨大成功和不断发展，使其渗透到商业领域和个人生活的各个方面。人们只要使用浏览器，就可以享受到各种各样的Web服务，例如网上购物，网上交易，网络游戏，预定车票，网上聊天和交友等等。由此，如何快速寻找到自己所需要的服务便成为当今的1个主题。
在以往的服务发现组合的过程中，服务被0散的发布，客户根据语法，语义和策略在服务注册机构中查找满足条件的服务，然后组合成符合用户要求的服务流。这种组合方法没有考虑服务提供组织提供的系列服务之间的联系和客户需要系列服务之间的逻辑关系，从而使得服务的发现和组合非常困难，因为服务提供商提供的服务数量是很大的，要在浩如烟海的服务中寻找单个的服务然后将它们组织起来并不是件容易的事情。
本是基于web服务而提出1种web组合新思路，即基于图匹配理论的web组合。通过此种方法可以高效地寻找到所需要查找的信息，以提高工作效率。
关键字：图匹配；WSDL；UDDI；SOAP；服务组合
 
Abstract
The huge success and continued development of Web Service make it pervade into every field of business and person’s life . More and more people just use IE and then could get all kinds of Web Service, such as Web Shopping , Web Transaction , Web Games , Web Chatting and Making Friends。How to find the service we need has become a new topic now.
When there are a large number of web services available, it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to compose multiple web services to fulfill the goal. Since the search space for such a composition problem is in general exponentially increasing, it is important to have wise decision on underlying data structures and search algorithms. 您可以访问中国科教评价网（www.NsEac.com）查看更多相关的文章。
This article is about the experiment based on a new association of web service, in another words ,that is a web association based on the theory of Graph match . By this new way, we can improve our efficiency to find the real information we need.
Keywords: The match of Graph; WSDL; UDDI; Association of web service

注释：不含源代码