Towards an efficient rule-based coordination of Web Services.

  1. Mata, E.J. 1
  2. Álvarez, P. 2
  3. Bañares, J.A. 2
  4. Rubio, J. 1
  1. 1 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

  2. 2 Universidad de Zaragoza
    info

    Universidad de Zaragoza

    Zaragoza, España

    ROR https://ror.org/012a91z28

Revista:
Lecture Notes in Computer Science

ISSN: 0302-9743

Año de publicación: 2004

Volumen: 3315

Páginas: 73-82

Tipo: Artículo

SCOPUS: 2-s2.0-22944490184 WoS: WOS:000226646200008 GOOGLE SCHOLAR

Otras publicaciones en: Lecture Notes in Computer Science

Resumen

Web services coordination has become a central topic for further development of Internet-based distributed computing. One approach to this coordination task is supported by generative communication, and more specifically by some implementations of the Linda model as JavaSpaces. However, when applying these coordination strategies to real projects, some drawbacks appear. One of the main limitations is the lack of transactional queries. In this paper we deal with this problem extending the matching mechanism of the Linda model. Then, a variant of the well-known RETE algorithm can be devised in order to implement our extended Linda model efficiently. This also opens new research lines in which Artificial Intelligence techniques (as advanced blackboard architectures) could be applied to the field of web services coordination. © Springer-Verlag Berlin Heidelberg 2004.