By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kaijun Ren ; National University of Defence Technology, Changsha ; Nong Xiao ; Jinjun Chen

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.

Published in:

IEEE Transactions on Services Computing  (Volume:4 ,  Issue: 3 )