Open access research
publication repository

Full Solution Indexing for top-K Web Service Composition [r-libre/953]

Li, Jing; Yan, Yuhong, & Lemire, Daniel (2018). Full Solution Indexing for top-K Web Service Composition. IEEE Transactions on Services Computing, 11 (3), 521 - 533. https://doi.org/10.1109/TSC.2016.2578924

File(s) available for this item:
[img]  PDF - bare_jrnl_compsoc.pdf
Content : Accepted Version
License : Creative Commons Attribution.
Item Type: Journal Articles
Refereed: Yes
Status: Published
Abstract: Automated service composition fulfills complex tasks by combining different existing web services together. Unfortunately, optimizing service composition is still a challenging area that needs to be addressed. In this article, we propose a novel relational database approach for automated service composition. All possible service combinations are generated beforehand and stored in a relational database. When a user request comes, our system composes SQL queries to search in the database and return the best Quality of Service (QoS) solutions. We test the performance of the proposed system with a web service challenge data set. Our experimental results demonstrate that this system can always find top-K valid solutions to satisfy user’s functional and non-functional requirements.
Official URL: https://ieeexplore.ieee.org/document/7488280/
Depositor: Lemire, Daniel
Owner / Manager: Daniel Lemire
Deposited: 07 Jun 2016 16:00
Last Modified: 21 Jan 2022 22:24

Actions (login required)