Indexing Semantic Versions in Rocksdb

Re:Indexing Semantic Versions in Rocksdb by utopcell on Friday January 05, 2024 @12:44PM (#38882000)

> "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.

[ Parent | on HN ]

Re:Indexing Semantic Versions in Rocksdb by klysm on Friday January 05, 2024 @11:49PM (#38888526)

I don’t see why that’s a particularly bad explanation of how RocksDB works

[ Parent | on HN ]

Re:Indexing Semantic Versions in Rocksdb by morelisp on Saturday January 06, 2024 @05:57PM (#38896436)

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.)

[ Parent | on HN ]