IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v2y2005i4p48-67.html
   My bibliography  Save this article

AND/OR Graph and Search Algorithm for Discovering Composite Web Services

Author

Listed:
  • Qianhui Althea Liang

    (Singapore Management University, Singapore)

  • Stanley Y.W. Su

    (University of Florida, USA)

Abstract

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.

Suggested Citation

  • Qianhui Althea Liang & Stanley Y.W. Su, 2005. "AND/OR Graph and Search Algorithm for Discovering Composite Web Services," International Journal of Web Services Research (IJWSR), IGI Global, vol. 2(4), pages 48-67, October.
    • Handle: RePEc:igg:jwsr00:v:2:y:2005:i:4:p:48-67
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jwsr.2005100103
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sowmya Kamath S & Ananthanarayana V. S., 0. "Discovering composable web services using functional semantics and service dependencies based on natural language requests," Information Systems Frontiers, Springer, vol. 0, pages 1-15.
    2. Sowmya Kamath S & Ananthanarayana V. S., 2019. "Discovering composable web services using functional semantics and service dependencies based on natural language requests," Information Systems Frontiers, Springer, vol. 21(1), pages 175-189, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwsr00:v:2:y:2005:i:4:p:48-67. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.