7 ms·
You can get a point read with just a single aligned random I/O operation on disk with this. I don't see how a B-tree based storage can compete. And even more o
by zzzcpan 7y ago
You can get a point read with just a single aligned random I/O operation on disk with this. I don't see how a B-tree based storage can compete.
And even more optimizations are possible, like grouping objects often accessed together into a single batch to retrieve the whole group in just one random operation too.
- liability 7y agoI'm sure you can go faster, but how much faster? The rowid b-tree lookup, with the b-tree in memory, will almost certainly be blazing fast compared to the actual disk read.