[barrkel]

B-trees, with their trade-off between slow disk seeks and fast in-memory scans, make just as much sense for slow memory accesses and fast in-cache scans.