.png){kind=icon}
返回
Scalable and efficient web services composition based on a relational database
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2011.05.068.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2011 Elsevier Inc. All rights reserved.
Keyword:
Web services
Web services composition
Semantic matching
Ontology
Relational database
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
查看更多机构
引用论文
.png){kind=icon}
A framework for QoS-aware binding and re-binding of composite web services一种用于组合web服务的QoS感知绑定和重新绑定的框架
PREAI
分享收藏
分享收藏Quality-of-service oriented web service composition algorithm and planning architecture面向服务质量的web服务组合算法及规划体系结构
PREAI
分享收藏 没有更多内容