Aug 24, 2021 · Fundamentals

B16 Hash Table: Exploiting Controlled Collisions and SIMD for High‑Performance, Compact Hashing

This article introduces the B16 hash table, a novel design that deliberately tolerates a higher hash‑collision probability and leverages SIMD instructions to achieve faster lookups, lower memory overhead, and a compact read‑only variant comparable to minimal perfect hash functions.

B16Memory OptimizationSIMD

0 likes · 15 min read

B16 Hash Table: Exploiting Controlled Collisions and SIMD for High‑Performance, Compact Hashing

Baidu Geek Talk

Feb 22, 2021 · Fundamentals

Can Embracing Hash Collisions Boost Performance? Inside B16 Hash Table

This article revisits traditional hash table design, then introduces a novel approach that deliberately leverages a controlled probability of hash collisions combined with SIMD parallelism, presenting the B16 and B16Compact hash tables, their structures, algorithms, and experimental results showing superior speed and space efficiency compared to unordered_map and F14.

B16Data StructuresSIMD

0 likes · 17 min read

Can Embracing Hash Collisions Boost Performance? Inside B16 Hash Table