Hash-consing MMDB search trees: 31% smaller files, identical lookups
mmaia
15 points
0 comments
October 14, 2026
Related Discussions
Found 5 related stories in 137.8ms across 9,516 title embeddings via pgvector HNSW
- Bonsai 2 27B: Near-Lossless Compression in a 9x Smaller Footprint JonSchneider · 344 pts · September 17, 2026 · 55% similar
- Static search trees: 40x faster than binary search (2024) lalitmaganti · 82 pts · July 17, 2026 · 54% similar
- Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores [pdf] ibobev · 24 pts · October 05, 2026 · 50% similar
- ParadeDB Search Performance Improvements craigkerstiens · 62 pts · October 01, 2026 · 46% similar
- Lossless model compression experiment: GLM-5.2 in 25% less memory hambandit · 16 pts · July 20, 2026 · 46% similar