Daniel Lemire: building billion-query-per-second lookup tables in C++
foltik · hn · 2026-10-28
Daniel Lemire published a blog post on building lookup tables in C++ that can serve a billion queries per second. He walks through the engineering techniques—hashing choices, memory layout, and batch processing—that push key-value lookups to extreme throughput.
More from Infra
- Wall Street gripped by new anxiety as it bankrolls AI's vast data center buildout — shiringhaffary · 2026-10-28
- Netflix runs observability on RDF/OWL/SHACL ontology, 38M log events per second — JeremyCMorgan · 2026-10-28
- Reproducible perf benchmarks made easy with the hf CLI skill and HF Jobs — victormustar · 2026-10-28
- Local NCM benchmarks: 4x faster for one request, 4-8x slower at 64 concurrent — Prompt Engineering · 2026-10-28
- TinyLeague drops Artificial Analysis scores, adds KV cache efficiency ratings for local models — nunodonato · 2026-10-28
- Can DeepSeek v4.1 actually run at 1-3 bpw? Reddit locals debate ultra-low quant usability — Plastic-Stress-6468 · 2026-10-28