Memory is slow, Disk is fast – Part 3
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
A benchmark by Jared Hulbert compares DiskArray, a sorted-key structure with 4 KiB extents on 8 NVMe drives, against an in-RAM AVL tree. At 2 billion nodes DiskArray reached 670K inserts/s with 264 MiB of RAM, versus 320K/s and 144 GiB for AVL. It won everything from 16M nodes up, despite worse Big O. Pipelined in-RAM B+tree and NextArray still beat it by 3-6x. The results come from one author's single hardware setup and one workload.