Data Structure

Fusion is a B-tree that there are at most $w^{1/6}$ keys in a node. These keys can be compressed into a single machine word using approximate Patricia code. Fusion Trees CS166: Data Structures

Cuckoo hashing is a perfect hashing algorithm. It has two tables T1, T2 and uses two different hash functions h1, h2. If the hash table contains the value v, it is either in T1[h1(v)] or T2[h2(v)].

Sardine tree is a B-tree which keys are small integers, and all the keys in a node can be packed into a single machine word. Integer algorithm exists to find the rank of a target integer in the packed node.