This question has been asked in the theoretical community, but deemed as too practical. I am moving it here, I hope it is on-topic.
I'd like to know more about real performances of data structures, in particular two families attract my interests:
- hash tables
- cache oblivious
My researches didn't find any "comprehensive" (let me use this adjective) book or article that describes the advantages and disadvantages of these two families. I have found the Intel's paper from this question, but it doesn't compare the two.
When is a hash table more performant than a cache oblivious data structure? What are the real use cases for a hash table, when is a cache oblivious B-tree (or simply binary) preferable?
The questions I'm asking are related not only on theoretical results, but also on real results on real computers.
I've read the book "Handbook of Data Structures and Applications", but it contains only theoretical limits, and it is not sufficient to me: I need to evaluate which data structures to implement on a real system.
Thanks for any pointers!
