Hacker News new | ask | show | jobs
by zokier 901 days ago
I don't know anything about rocksdb, but this approach on surface level seems like it could be very slow? Wouldn't it be more efficient to encode the semver in a format more suitable to sorting
2 comments

By default RocksDB uses a ByteWiseComparator to sort the keys in the SST. However, RocksDB allows you to provide any comparator you wish. So ultimately it will depend on the performance of the comparator that you implement.
Sure, the old performance/productivity tradeoff.

This quickly solves the problem then you can iterate for performance.