Skip to main navigation Skip to search Skip to main content

MEMORY: A matrix-based efficient semantic web service discovery system

  • Zhuo Zhao*
  • , Dianfu Ma
  • , Jing Li
  • , Xianyang Qu
  • *Corresponding author for this work
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

With the advance of Semantic Web, the adoption of Semantic Web has been regarded as the most promising way to improve the recall rate and precision rate of service discovery. However, Semantic Web Service discovery (SWS) is essentially not used on a large scale in real business world due to its timeconsuming performance and weak support for the QoS-based discovery. In order to solve these problems, this paper presents a matrix-based efficient SWS discovery system, namely MEMORY. MEMORY does ontological pre-reasoning and holds the reasoning results in matrix forms in service publishing phase, so that it can transfer the load of semantic reasoning from service query to service publication and perform fast matching during service discovery. The experiments in the end are conducted to further demonstrate the feasibility of our proposed matching approach and its high efficiency.

Original languageEnglish
Title of host publication2009 5th International Conference on Next Generation Web Services Practices, NWeSP 2009
Pages29-36
Number of pages8
DOIs
StatePublished - 2009
Event2009 5th International Conference on Next Generation Web Services Practices, NWeSP 2009 - Prague, Czech Republic
Duration: 9 Sep 200911 Sep 2009

Publication series

Name2009 5th International Conference on Next Generation Web Services Practices, NWeSP 2009

Conference

Conference2009 5th International Conference on Next Generation Web Services Practices, NWeSP 2009
Country/TerritoryCzech Republic
CityPrague
Period9/09/0911/09/09

Fingerprint

Dive into the research topics of 'MEMORY: A matrix-based efficient semantic web service discovery system'. Together they form a unique fingerprint.

Cite this