4 ms·
> Compressed data, decompressed into cpu cache, and then scanned. Almost no indexing at all, just cpu cache for speed. Where are these programs not using the C
by mhh__ 6y ago
> Compressed data, decompressed into cpu cache, and then scanned. Almost no indexing at all, just cpu cache for speed.
Where are these programs not using the CPU cache?
- chii 6y agoassume they meant decompress small enough a block to fit the CPU cache, and do in-memory scans.
- hinkley 6y agoIndexes and tree structures involve pointer walking. Nothing is even guaranteed to be in main memory, nevermind L2 cache. These guys apparently went straight from disk (linear reads) to L1/L2.