Billion-query-per-second lookup tables in C++
foltik
13 points
1 comment
October 28, 2026
Related Discussions
Found 5 related stories in 119.5ms across 10,780 title embeddings via pgvector HNSW
- Static search trees: 40x faster than binary search (2024) lalitmaganti · 82 pts · July 17, 2026 · 49% similar
- Hash-consing MMDB search trees: 31% smaller files, identical lookups mmaia · 15 pts · October 14, 2026 · 47% similar
- Any text-to-SQL benchmark should address difficulties of real-world data stores shenli3514 · 45 pts · July 22, 2026 · 46% similar
- 118M Queries per Second on Neki joshmgross · 89 pts · September 11, 2026 · 46% similar
- 6× faster binary search: from compiled code to mechanical sympathy enz · 15 pts · July 12, 2026 · 45% similar
Discussion Highlights (1 comments)
Panzerschrek
Nice approach. I hope some time compilers will eventually learn to detect code containing a bunch of if-else with string comparison and replace it with perfect hashing.