Re:How does a B-tree make queries fast?
by tomnipotent on Saturday December 23, 2023 @08:34PM
(#38750213)
> What was the struggle?
Performance is always great until you have to hit disk. Not uncommon to rely on mmap at which point your disk access is sub-optimal vs. a hand-tailored buffer manager with strategies to improve disk reads.
Re:How does a B-tree make queries fast?
by fsckboy on Saturday December 23, 2023 @10:55PM
(#38750960)
the purpose of a btree is to optimize when you are hitting the disk, you can't call that the struggle, that's when the btree sings (tho you could consider extensible hashing)
Performance is always great until you have to hit disk. Not uncommon to rely on mmap at which point your disk access is sub-optimal vs. a hand-tailored buffer manager with strategies to improve disk reads.