Further structures and analysis

Caches and filters

Intermediate · 20 minYou are hereRead

LRU caches

A hash table that points into a doubly linked list finds any cached item in one step and keeps the items in order of use, so the least recently used is evicted when the cache is full.

Intermediate · 20 minYou are hereRead

Bloom filters

Setting k bits per item in a bit array answers “is this in the set?” with “certainly not” or “probably”, using far less memory than storing the items.

Caches and filters

LRU caches

Bloom filters

Where to go next.

Account

Subjects

Site

Look

Lessons on this topic

LRU caches

Bloom filters