[zeromq-dev] Radix tree perf?

[Axel R.]

I'm running the *benchmark_radix_tree* test app and what I see is the radix
tree is considerably slower than the trie from 1 to at least 10 million
keys.

Is the test representative of real-world use in ZeroMQ? If yes, in which
circumstance(s) would one want to enable that option?

keys = 1, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.0 ns
[radix_tree]
Average lookup time = 31.6 ns

keys = 10, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.2 ns
[radix_tree]
Average lookup time = 41.1 ns

keys = 100, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.2 ns
[radix_tree]
Average lookup time = 58.0 ns

keys = 1000, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.2 ns
[radix_tree]
Average lookup time = 74.3 ns

keys = 10000, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.3 ns
[radix_tree]
Average lookup time = 117.1 ns

keys = 100000, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.0 ns
[radix_tree]
Average lookup time = 217.4 ns

keys = 1000000, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.0 ns
[radix_tree]
Average lookup time = 462.3 ns

keys = 10000000, queries = 1000000, key size = 20
[trie]
Average lookup time = 17.3 ns
[radix_tree]
Average lookup time = 722.6 ns
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.zeromq.org/pipermail/zeromq-dev/attachments/20231111/cc00b235/attachment.htm>