[zeromq-dev] scalability of zeromq in terms fof queues and topics
sustrik at 250bpm.com
Thu Apr 8 16:25:14 CEST 2010
Martin Sustrik wrote:
> 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.
Btw, here's the code. It's pretty simple:
Have a look and give it a thought. If you can make it even faster, let's
go for it!
More information about the zeromq-dev