Combining Schema and Level-Based Matching for Web Service Discovery

  • Alsayed Algergawy
  • Richi Nayak
  • Norbert Siegmund
  • Veit Köppen
  • Gunter Saake
Conference paper

DOI: 10.1007/978-3-642-13911-6_8

Volume 6189 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Algergawy A., Nayak R., Siegmund N., Köppen V., Saake G. (2010) Combining Schema and Level-Based Matching for Web Service Discovery. In: Benatallah B., Casati F., Kappel G., Rossi G. (eds) Web Engineering. ICWE 2010. Lecture Notes in Computer Science, vol 6189. Springer, Berlin, Heidelberg

Abstract

Due to the availability of huge number of Web services (WSs), finding an appropriate WS according to the requirement of a service consumer is still a challenge. In this paper, we present a new and flexible approach, called SeqDisc, that assesses the similarity between WSs. In particular, the approach exploits the Prüfer encoding method to represent WSs as sequences capturing both semantic and structure information of service descriptions. Based on the sequence representation, we develop an efficient sequence-based schema matching approach to measure the similarity between WSs. A set of experiments is conducted on real data sets, and the results confirm the performance of the proposed solution.

Keywords

Web service WS discovery WSDL Schema matching 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Alsayed Algergawy
    • 1
  • Richi Nayak
    • 2
  • Norbert Siegmund
    • 3
  • Veit Köppen
    • 3
  • Gunter Saake
    • 3
  1. 1.Department of Computer ScienceUniversity of LeipzigGermany
  2. 2.Queensland University of TechnologyBrisbaneAustralia
  3. 3.School of Computer ScienceUniversity of MagdeburgGermany