TechLobstersabout 2 hours ago
DiskArray Beats RAM for Random Access
19 min read
A new DiskArray data structure using 8 NVMe drives and 264 MiB of RAM outperforms an AVL binary tree requiring 144 GiB of RAM for 2 billion nodes. The system handles 2048 queued transactions across 28 workers and 8 drives, proving disk-based storage can beat in-memory structures for random reads and writes.
Level
Hype check
Tap to vote and see what everyone thinks.