The Journal of Systems and Software
The Journal of Systems and Software
复制标题
DOI：
10.1016/j.jss.2011.05.068
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
Daewook Lee;Joonho Kwon;Sangjun Lee;Seog Park;Hong c
中科院分区：
文献类型：
--
作者：
Daewook Lee;Joonho Kwon;Sangjun Lee;Seog Park;Hong c
近年来，人们对Web服务组合越来越感兴趣。Web服务组合为我们提供了一种可能性，以满足用户的请求时，没有一个单一的Web服务可以满足用户所需的功能。在本文中，我们提出了一个新的系统称为PSR的可扩展性和高效的Web服务组合搜索使用关系数据库。与以前的工作相比，PSR系统预先计算Web服务组合使用连接和索引，也支持Web服务组合的语义匹配。我们表明，我们的预计算Web服务组合方法在RDBMS中产生较低的执行时间处理用户查询，尽管和处理大量的Web服务和用户查询时，表现出良好的可扩展性。
Recently, there has been growing interest in web services composition. Web services composition gives us a possibility to fulfil the user request when no single web service can satisfy the functionality required by the user. In this paper, we propose a new system called PSR for the scalable and efficient web services composition search using a relational database. In contrast to previous work, the PSR system pre-computes web services composition using joins and indices and also supports semantic matching of web services composition. We demonstrate that our pre-computing web services composition approach in RDBMS yields lower execution time for processing user queries despite of and shows good scalability when handling a large number of web services and user queries.