Number of the records: 1  

Efficient Discovery of Collision-free Service Combinations

  1. 1.
    SYSNO ASEP0330987
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleEfficient Discovery of Collision-free Service Combinations
    Author(s) Vaculín, Roman (UIVT-O)
    Sycara, K. (US)
    Source TitleICWS 2009. - Los Alamitos : IEEE Computer Society, 2009 / Wei S. ; I-Ling Y. ; Thuraisingham B. ; Bertino E. - ISBN 978-1-4244-4929-3
    Pagess. 165-172
    Number of pages8 s.
    ActionICWS 2009. IEEE International Conference on Web Services
    Event date06.07.2009-10.07.2009
    VEvent locationLos Angeles
    CountryUS - United States
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordsdiscovery of services ; services matchmaking ; web services combinations ; semantic web services ; efficient services discovery
    Subject RIVIN - Informatics, Computer Science
    R&D Projects1ET100300517 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    ME08095 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000273268500021
    DOI10.1109/ICWS.2009.105
    AnnotationMajority of service discovery research considers only primitive services as a suitable match for a given query while service combinations are not allowed. However, many realistic queries cannot be matched by individual services and only a combination of several services can satisfy such queries. Allowing service combinations or proper compositions of primitive services as a valid match introduces problems such as unwanted side-effects (i.e., producing an effect that is not requested), effect duplications (i.e., producing some effect more than once) and contradictory effects (i.e., producing both an effect and its negation). Also the ranking of matched services has to be reconsidered for service combinations. In this paper, we address all the mentioned issues and present a matchmaking algorithm for retrieval of the best top k collision-free service combinations satisfying a given query.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.