EFFICIENTLY LOCATING WEB SERVICES USING A SEQUENCE-BASED SCHEMA MATCHING APPROACH

Alsayed Algergawy, Eike Schallehn, Gunter Saake

Abstract

Locating desiredWeb services has become a challenging research problem due to the vast number of available Web services within an organization and on the Web. This necessitates the need for developing flexible, effective, and efficient Web service discovery frameworks. To this purpose, both the semantic description and the structure information of Web services should be exploited in an efficient manner. This paper presents a flexible and efficient service discovery approach, which is based on the use of the Pr¨ufer encoding method to construct a one-to-one correspondence between Web services and sequence representations. In this paper, we describe and experimentally evaluate our Web service discovery approach.

References

  1. Al-Masri, E. and Mahmoud, Q. (2007). Qos-based discovery and ranking of web services. In ICCCN 2007, pages 529 - 534.
  2. Algergawy, A., Schallehn, E., and Saake, G. (2008). A Prufer sequence-based approach for schema matching. In BalticDB&IS2008. Estonia.
  3. Atkinson, C., Bostan, P., Hummel, O., and Stoll, D. (2007). A practical approach to web service discovery and retrieval. In ICWS 2007, pages 241-248.
  4. Bose, A., Nayak, R., and Bruza, P. (2008). Improving web service discovery by using semantic models. In WISE 2008, pages 366-380. New Zealand.
  5. Hao, Y. and Zhang, Y. (2007). Web services discovery based on schema matching. In ACSC2007, pages 107-113. Australia.
  6. Ma, J., Zhang, Y., and He, J. (2008). Efficiently finding web services using a clustering semantic approach. In CSSSIA 2008, page 5. China.
  7. Nayak, R. and Lee, B. (2007). Web service discovery with additional semantics and clustering. In IEEE/WIC/ACM International Conference on Web Intelligence, WI2007, pages 555 - 558.
  8. Prufer, H. (1918). Neuer beweis eines satzes uber permutationen. Archiv fur Mathematik und Physik, 27:142- 144.
  9. Tatikonda, S., Parthasarathy, S., and Goyder, M. (2007). LCS-TRIM: Dynamic programming meets XML indexing and querying. In VLDB'07, pages 63-74.
  10. Wang, Y. and Stroulia, E. (2003). Flexible interface matching for web-service discovery. In WISE 2003, pages 147-156. Italy.
Download


Paper Citation


in Harvard Style

Algergawy A., Schallehn E. and Saake G. (2009). EFFICIENTLY LOCATING WEB SERVICES USING A SEQUENCE-BASED SCHEMA MATCHING APPROACH . In Proceedings of the 11th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8111-84-5, pages 287-290. DOI: 10.5220/0001969702870290


in Bibtex Style

@conference{iceis09,
author={Alsayed Algergawy and Eike Schallehn and Gunter Saake},
title={EFFICIENTLY LOCATING WEB SERVICES USING A SEQUENCE-BASED SCHEMA MATCHING APPROACH},
booktitle={Proceedings of the 11th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2009},
pages={287-290},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001969702870290},
isbn={978-989-8111-84-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - EFFICIENTLY LOCATING WEB SERVICES USING A SEQUENCE-BASED SCHEMA MATCHING APPROACH
SN - 978-989-8111-84-5
AU - Algergawy A.
AU - Schallehn E.
AU - Saake G.
PY - 2009
SP - 287
EP - 290
DO - 10.5220/0001969702870290