Hacker News new | ask | show | jobs
by utopcell 899 days ago
> "The technical primitive data structure here is a hashmap where the keys are sorted."

..somewhere, this person's algorithms teacher is pondering about his life choices.

1 comments

I don’t see why that’s a particularly bad explanation of how RocksDB works
It's not using hashes.

(OK, well, it is maybe using hashes for the per-SST Bloom filter, but that's not what's interesting here. It's maybe also using hashes in the memtable in which case they're using it very inefficiently since the key encoding is not prefix-scan-friendly.)