AND/OR Graph and Search Algorithm for Discovering Composite Web Services
This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that can only be satisfied by a composition...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/217 https://ink.library.smu.edu.sg/context/sis_research/article/1216/viewcontent/ANDOR_Graph_Search_2005.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-1216 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-12162018-06-29T09:06:59Z AND/OR Graph and Search Algorithm for Discovering Composite Web Services LIANG, Qianhui (Althea) SU, Stanley Y. W. This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that can only be satisfied by a composition of Web Services, we identify the service categories that are relevant to the request and dynamically construct an AND/OR graph to capture the input/output dependencies among the Web Services of these service categories. The graph is modified, based on the information provided in the service request. The search algorithm is then used to search the modified AND/OR graph for a minimal and complete composite service template that satisfies the service request. The algorithm can be applied repeatedly to the graph to search for alternative templates until the result is approved by the service requester. We have evaluated the algorithm both analytically and experimentally, and the experiment results are presented. 2005-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/217 info:doi/10.4018/jwsr.2005100103 https://ink.library.smu.edu.sg/context/sis_research/article/1216/viewcontent/ANDOR_Graph_Search_2005.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University AND/OR graph search algorithm service discovery Web Service composition Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
AND/OR graph search algorithm service discovery Web Service composition Software Engineering |
spellingShingle |
AND/OR graph search algorithm service discovery Web Service composition Software Engineering LIANG, Qianhui (Althea) SU, Stanley Y. W. AND/OR Graph and Search Algorithm for Discovering Composite Web Services |
description |
This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that can only be satisfied by a composition of Web Services, we identify the service categories that are relevant to the request and dynamically construct an AND/OR graph to capture the input/output dependencies among the Web Services of these service categories. The graph is modified, based on the information provided in the service request. The search algorithm is then used to search the modified AND/OR graph for a minimal and complete composite service template that satisfies the service request. The algorithm can be applied repeatedly to the graph to search for alternative templates until the result is approved by the service requester. We have evaluated the algorithm both analytically and experimentally, and the experiment results are presented. |
format |
text |
author |
LIANG, Qianhui (Althea) SU, Stanley Y. W. |
author_facet |
LIANG, Qianhui (Althea) SU, Stanley Y. W. |
author_sort |
LIANG, Qianhui (Althea) |
title |
AND/OR Graph and Search Algorithm for Discovering Composite Web Services |
title_short |
AND/OR Graph and Search Algorithm for Discovering Composite Web Services |
title_full |
AND/OR Graph and Search Algorithm for Discovering Composite Web Services |
title_fullStr |
AND/OR Graph and Search Algorithm for Discovering Composite Web Services |
title_full_unstemmed |
AND/OR Graph and Search Algorithm for Discovering Composite Web Services |
title_sort |
and/or graph and search algorithm for discovering composite web services |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2005 |
url |
https://ink.library.smu.edu.sg/sis_research/217 https://ink.library.smu.edu.sg/context/sis_research/article/1216/viewcontent/ANDOR_Graph_Search_2005.pdf |
_version_ |
1770570341571100672 |