[erlang-questions] Benchmarking Erlang: Deathmatch of gb_trees, dict, ets, mnesia ... and registered names

[Richard Carlsson]

Tony Finch wrote:
> On Thu, 9 Oct 2008, Richard Carlsson wrote:
>> The hint is that your numbers _should_ scale at least linearly with
>> the number of elements,
> 
> Shouldn't lookup be O(log n)?

Yes, if you do it once. But these runtimes were measured
over n calls. (For populate, it gets a bit more complicated
since the first operations work on a small dictionary and the
last operations work on a huge one, but for lookup the total
time should be a straightforward O(n*log n) for gb_trees.)

    /Richard