Hello everyone,
> It should be noted that such workload does not really represents 'real life'
> results,
> as all contention goes into certain partitions (in case of hashtable) and
> subtrees (in case of tree).
> Next goal is to compare data structures on some kind of realistic benchmark
> or
Greetings all,
> So, this is a plan, that I would like to stick with subsequently:
>
> 1) Work on synchronization.
> 2) Examine bulk operations on buffers, replace them with tree (prefix)
> iterator.
> 3) A reasonable way to size memory for tree maintenance.
>
previously i described the plan, th
