[zeromq-dev] Exact matching on subscription topics

Stephen Lord Stephen.Lord at quantum.com
Thu Jan 19 03:47:53 CET 2012


> Yes. Agreed. Complex filtering, even SQL-like filters offered by some 
> enterprise middleware implementations, is probably out-of-scope for 0MQ.
> 
> However, few simple filtering algorithms (exact, prefix, regexp?) that 
> can be performed at wire speed may be in scope.
> 
> The question here is how to implement the latter.
> 
> The important point is that the filtering algorithm should be 
> distributed to every node in the message distribution tree. Thus, 
> supplying a callback function at the subscriber won't do.
> 
> I suggest reading the past posts in this thread. There's a disucssion of 
> the algorithm that would allow for new filtering algorithms that 
> wouldn't break the old intermediate nodes not aware of the new algorithm.
> 
> Martin

I just saw this topic pop up in my email, while in another window I was
reading something on compression algorithms, and discussion of fast
prefix matching....

Perhaps this is a component of what you are looking for:

http://fastcompression.blogspot.com/2011/12/fast-sequence-comparison.html

Steve

----------------------------------------------------------------------
The information contained in this transmission may be confidential. Any disclosure, copying, or further distribution of confidential information is not permitted unless such privilege is explicitly granted in writing by Quantum. Quantum reserves the right to have electronic communications, including email and attachments, sent across its networks filtered through anti virus and spam software programs and retain such messages in order to comply with applicable data security and retention requirements. Quantum is not responsible for the proper and complete transmission of the substance of this communication or for any delay in its receipt.



More information about the zeromq-dev mailing list