A matching algorithm for selecting web services based on non-functional features

Said Elnaffar

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Searching for a Web service that meets the user requirements can be a complex task especially when the system starts to scale up by increasing the number of Web services, w, in the UDDI registry and by enlarging the number of QoS features (f) by which each Web service is described. This can be perceived as the commonly known nearest neighbor search problem, which typically imposes a time or storage complexity that is exponential in f. In this work, we present a new algorithm (wsSVD) that is founded on the algebraic matrix operation called Singular Value Decomposition (SVD). The basic idea is to encode the features of each Web service by a single value using the SVD. When a user seeks a Web service based on some specific requirements, these requirements get encoded by a single value using the same algorithm, and the matching process takes place in order to find the closest Web service that fulfills the user requirements. Our experiments show that the wsSVD algorithm performs and scales up well in comparison with other matching algorithms.

    Original languageEnglish
    Title of host publication14th Americas Conference on Information Systems, AMCIS 2008
    Pages2915-2925
    Number of pages11
    Publication statusPublished - 2008
    Event14th Americas Conference on Information Systems, AMCIS 2008 - Toronto, ON, Canada
    Duration: Aug 14 2008Aug 17 2008

    Publication series

    Name14th Americas Conference on Information Systems, AMCIS 2008
    Volume5

    Other

    Other14th Americas Conference on Information Systems, AMCIS 2008
    Country/TerritoryCanada
    CityToronto, ON
    Period8/14/088/17/08

    Keywords

    • Nearest neighbor search
    • Qos
    • Search algorithm
    • Singular value decomposition
    • Svd
    • Uddi

    ASJC Scopus subject areas

    • Computer Science Applications
    • Computer Networks and Communications
    • Library and Information Sciences
    • Information Systems

    Fingerprint

    Dive into the research topics of 'A matching algorithm for selecting web services based on non-functional features'. Together they form a unique fingerprint.

    Cite this