Get the latest tech news
A hash table by any other name
This article brought to you by LWN subscribers Subscribers to LWN.net made this article — and everything that surrounds it — possible. If you appreciate our content, please buy a subscription and make the next set of articles possible.
On June 25, Matthew Wilcox posted a second version of a patch set introducing a new data structure called rosebush, which " is a resizing, scalable, cache-aware, RCU optimised hash table." Rosebush is intended to present roughly the same API as rhashtable, with the main difference for users being the performance of the two hash tables — something which is critically important to the dcache, since it is referenced during almost all filesystem operations. In response to the first version of the patch set (from February), Herbert Xu disagreed, pointing out that an rhashtable is resized whenever the table reaches 75% capacity, so the average bucket contains only one item.
Or read this on Hacker News
