Scalable and efficient web services composition based on a relational database

  • Authors:

  • Daewook Lee;Joonho Kwon;Sangjun Lee;Seog Park;Bonghee Hong

  • Affiliations:

  • Department of Computer Science and Engineering, Sogang University, Seoul 121-742, Republic of Korea;Institute of Logistics Information Technology, Pusan National University, Busan 609-735, Republic of Korea;School of Computing, Soongsil University, Seoul 156-743, Republic of Korea;Department of Computer Science and Engineering, Sogang University, Seoul 121-742, Republic of Korea;Department of Computer Engineering, Pusan National University, Busan 609-735, Republic of Korea

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abstract: 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.