Re: how do I benchmark tables

[Coda Highland <chighland@...>]

Here's what Google uses for benchmarking C++ hashtable implementations: 

https://github.com/google/hashtable-benchmarks/blob/master/hashtable_benchmarks.cc

I wouldn't expect the specific implementations to be helpful to you, but looking at the test cases they run might be helpful.

/s/ Adam

On Tue, May 26, 2020 at 11:32 AM Andrea <andrea.l.vitali@gmail.com> wrote:

Benchmarking hash tables is a very difficult task.

Can someone point me to some good source on how to best do that?

I guess I should benchmark several cases such as insert, then un/successful look-ups; multiple sequences of deletion and insertions; using random strings or words in a corpus.

    Andrea

--

Andrea Vitali