PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Generic Constraints for Content-Based Publish/Subscribe
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
JOLIE: a Java Orchestration Language Interpreter Engine
Electronic Notes in Theoretical Computer Science (ENTCS)
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
Correlation patterns in service-oriented architectures
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
| Hi-index | 0.00 |
A fundamental aspect which affects the efficiency and the performance of Service-Oriented Architectures is the mechanism which allows to manage sessions and, in particular, to assign incoming messages to the correct sessions (also known as service instances). A relevant mechanism for solving this problem, first introduced by BPEL and then used in other languages (e.g. Jolie) is that one based on correlation sets. The BPEL and Jolie languages are currently allowing the use of messages whose target is only one session. However there are a lot of scenarios where being able to send a broadcast message to more than one session could be useful. Supporting such a broadcast primitive means to allow correlation sets which can contain unspecified variables and this can be very inefficient, since usual implementations in terms of hash tables cannot be used in this case. In this paper we propose a data structure, based on radix trees and an algorithm for managing a correlation mechanism that supports the broadcast primitive, without degrading the performances.