iiinova — where your digital self keeps evolving

Replies

kero @kerollmops.com · 07/02/2025

Nice article; it is easy to understand, and I am happy to see a new Rust key-value store. However, I have a few questions. Where is the code? I found this PR, which introduced the gridstore name but hasn't landed on main. github.com/qdrant/qdran... 1/4

github.com

Rename `blob_store` as `gridstore` by coszio · Pull Request #5918 · qdrant/qdrant

We've been preparing an article with will expose the project publicly. I don't love blob_store name so much because it has Binary Large OBject baggage, which is not exactly what we tried to...

210

kero @kerollmops.com · 07/02/2025

The Bustle benchmarks seem to run in parallel, but it's not clear enough in the article. I guessed that, thanks to the Bustle description. Are you running them in parallel, and on what kind of machine/architecture? github.com/jonhoo/bustle 2/4

github.com

GitHub - jonhoo/bustle: A benchmarking harness for concurrent key-value collections

A benchmarking harness for concurrent key-value collections - jonhoo/bustle

200

Qdrant @qdrant.bsky.social · 07/02/2025

Bustle benchmark was run single-threaded, because we use our segments single-threaded.

110

kero @kerollmops.com · 07/02/2025

In the article, you explain that you need to generate sequential internal ID keys (Meilisearch also uses u32s internally to identify documents). Is this the same use case? What do you use them for? Do you reuse the IDs when deletions happen? And what is the integer size do you use? 3/4

Since internal IDs are always sequential integers

200