Building Quick Service Query List Using WordNet and Multiple Heterogeneous Ontologies toward More Realistic Service Composition

被引:23
作者
Ren, Kaijun [1 ]
Xiao, Nong
Chen, Jinjun [2 ]
机构
[1] Natl Univ Def Technol, Inst Software, Coll Comp, Changsha 410073, Hunan, Peoples R China
[2] Swinburne Univ Technol, Ctr Complex Software Syst & Serv CS3, Fac Informat & Commun Technol, Melbourne, Vic 3122, Australia
关键词
Service discovery; service composition; WordNet; multiple heterogeneous ontologies; WEB SERVICES; DISCOVERY; MODEL;
D O I
10.1109/TSC.2010.24
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Although semantic-based composition approaches have brought some comprehensive advantages such as higher precisions and recalls, they are far from the real practice and hard to be applied in real-world applications due to the several challenging issues such as performance issues of time-consuming ontology reasoning, exponentially expanded searching time in large service repositories, lack of available and consensus ontologies, and higher using thresholds for users who do not have much semantic knowledge. To reduce these issues, in this paper, we present an innovative composition technique by building an Extended Quick Service Query List (EQSQL) for supporting more efficient and more realistic service composition. In EQSQL, data structures are specially designed to record service information and their associated semantic concepts by in advance processing semantic-related computing during service publication period. Particularly, WordNet and semantic similarities among multiple heterogeneous ontologies are exploited in our developed algorithms for forming EQSQL. As a result, EQSQL-based planning algorithm can not only achieve a quick response for a composition request, but guarantee the semantic composition quality as well. More importantly, our approaches can be scalable to the large service repositories and also significantly alleviate users or developers from the burden of using complicated semantic service composition, thus making service composition easier and more realistic. Our final experiments further demonstrate the feasibility and the efficiency of our proposed approaches.
引用
收藏
页码:216 / 229
页数:14
相关论文
共 53 条
  • [1] AGGARWAL R, 2004, P IEEE INT C SERV CO
  • [2] AUTOMATIC SPELLING CORRECTION USING A TRIGRAM SIMILARITY MEASURE
    ANGELL, RC
    FREUND, GE
    WILLETT, P
    [J]. INFORMATION PROCESSING & MANAGEMENT, 1983, 19 (04) : 255 - 261
  • [3] [Anonymous], INT J WEB SERVICES R
  • [4] [Anonymous], 2009, WEB SERVICE CHALLENG
  • [5] Using concept lattices to support service selection
    Aversano, Lerina
    Bruno, Marcello
    Canfora, Gerardo
    Di Penta, Massimiliano
    Distante, Damiano
    [J]. INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH, 2006, 3 (04) : 32 - 51
  • [6] On automating Web services discovery
    Benatallah, B
    Hacid, MS
    Leger, A
    Rey, C
    Toumani, F
    [J]. VLDB JOURNAL, 2005, 14 (01) : 84 - 96
  • [7] BERARDI D, 2003, P 1 INT C SERV OR CO
  • [8] Semantics-Based Composition-Oriented Discovery of Web Services
    Brogi, Antonio
    Corfini, Sara
    Popescu, Razvan
    [J]. ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 2008, 8 (04)
  • [9] A formal model of services
    Broy, Manfred
    Krueger, Ingolf H.
    Meisinger, Michael
    [J]. ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2007, 16 (01)
  • [10] Cabral L., 2006, P 5 INT SEM WEB C NO