[zeromq-dev] scalability of zeromq in terms fof queues and topics

Martin Sustrik sustrik at 250bpm.com
Thu Apr 8 16:20:17 CEST 2010


> Thanks for your response. It is indeed helpful. However it is quite esoteric
> that the topic x subscriber lookup is an O(1) lookup. My quick question here
> though is that is it a practical O(1) lookup or in a practical scenario with
> a large quantity (say 1 million topics and 1 million subscribers) it would
> degrade. For instance - a hash table is theoretically an O(1) lookup but not
> in practice :)

It's practical O(1), there's no hash table. It's basically an N-ary 
search tree where first branching corresponds to first character of the 
topic, second branchings correspond to second character etc. Thus you 
never get hash conflicts.

> w.r.t the second note - I will keep you posted once we do some testing. If
> anyone is interested we could also setup some hardware which can be used to
> run these tests



More information about the zeromq-dev mailing list