I wonder when this "databases are nearly always bottlenecked on IO" perception finally is going to die. I think it's been false for > 50% of instances for at least 15 years. And it's just plainly wrong when we can have small-ish servers with >16 internal NVMe drives.
-
-
Similar for checksums. Decent non-crypto hashes can reach > 4GB/s. And with hardware assist more is possible. The difficulty really is to have large enough runs to be checksummed/decompressed at once.
-
Kinda curious now whether the crc32c instruction can benefit from pipelining to make it worthwhile to compute checksums for several blocks at once.
- 6 more replies
New conversation -
-
-
And Postgres with heap organized tables can drive higher IO rates than the clustered index approaches I am used to.
@Cyan4973 has done great work for DBMS with lz4 and zstdThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.