Kerollmops

5 ms·

1.
by Kerollmops 3mo ago
Actually, you should take a look at [1]. It's made in Rust, inspired by LMDB, and supports a cool feature that allows close to anything to be implemented: allocating any page you want to store anything you want. The BTree storage is o
2.
by Kerollmops 3mo ago
Yup! Same, I'm the maintainer of the main LMDB Rust wrapper [1] and I was maintaining heed and heed3 (because 1.0 was available from the mdb.master3 branch). But now that it's LMDB 1.0, I need to find a better way to make it be th
3.
by Kerollmops 3mo ago
Yeah, and I also added support for parallel read your own writes where you can write tons of entries and spawn multi children read-only transactions from your writes where transaction and read from them in parallel. We use this in Meilisear
4.
by Kerollmops 3mo ago
I recently talked to Howard [1] about lies he was saying about Sanakirja, an LMDB-inspired disk allocator. That's always the same arguments: C is better than Rust for X, Y or Z reasons. While I reported a segfault just two weeks earlie
5.
Patching LMDB: How We Made Meilisearch's Vector Store 333% Faster(blog.kerollmops.com)
1 points by Kerollmops 6mo ago|0 comments
6.
by Kerollmops 9mo ago
So nice! That's an excellent extract and looks useful for benchmarking Meilisearch. I'll probably spend my Christmas holidays importing the tracks, albums, and artists into Meilisearch, while my CEO builds a beautiful front-end fo
7.
Meilisearch: Speeding up vector search 10x with Hannoy(blog.kerollmops.com)
7 points by Kerollmops 9mo ago|0 comments
8.
by Kerollmops 1y ago
Someone reported it, and I answered today [1]. It's a rule that is too hard on the front end, and we will fix it by using a better Hybrid search setup (not only semantic). Thank you for the report. [1]: https://github.com&#x
9.
by Kerollmops 1y ago
V1.14, released yesterday [1], ships with a search embedding cache. Most of the time you see is spent waiting for an OpenAI embedding answer. We also just shipped composite embedders to reduce the network latency when you need to respond qu
10.
by Kerollmops 1y ago
HuggingFace is using Meilisearch, in production, on their website for a year now.
11.
by Kerollmops 1y ago
You should try Meilisearch then, you'll be astonished by the quality of the results and the ease of setup.
12.
by Kerollmops 1y ago
Right. We released a lot of new versions of the engine to improve the indexing part of it. V1.12 is improving the document indexing a lot! Have you tried the latest version v1.14 we released yesterday? While Meilisearch is capable of limiti
13.
by Kerollmops 1y ago
Meilisearch is faster when you reduce the dataset by filtering it. I wrote an article on this subject [1]. [1]: https://blog.kerollmops.com/meilisearch-vs-qdrant-tradeoffs-...
14.
by Kerollmops 1y ago
35 GiB is probably a third of the data I index into Meilisearch just for experimenting and don't forget about the inverted indexes. You wouldn't use any O(n) algorithm to search in your documents. Also, every time you need to rebo
15.
by Kerollmops 1y ago
> [..] to simplify the setup? It would be simpler to keep Meilisearch and its key-value store out of Postgres' WAL and stuff and better propose a good SQL exporter (in the plan).
16.
by Kerollmops 1y ago
The best you could do is put Meilisearch on a very good NVMe. I am indexing large streams of content (Bsky posts + likes), and I assure you that I tested Meilisearch on a not-so-good NVMe and a slow HDD — and ho, Boy!! The SSD is so much fa
17.
by Kerollmops 1y ago
Meilisearch just improved the indexing speed and simplified the update path. We released v1.12 and highly improved indexing speed [1]. We improved the upgrade path with the dumpless upgrade feature [2]. The main advantage of Meilisearch is
18.
by Kerollmops 1y ago
> I'm still looking for a systematic approach to make a hybrid search (combined full-text with embedding vectors). You know that Meilisearch is the way to go, right? Tantivy, even though, I love the product, doesn't support vec
19.
by Kerollmops 1y ago
Meilisearch decided to use hybrid search and avoid fusion ranking. We plan to work on reranking soon, but as far as I know, our hybrid search is so good that nobody asked for reranking. You can read more about our Hybrid search in our blog
20.
by Kerollmops 1y ago
Meilisearch has been production-ready since v1.0. I made it in Rust to ensure it stays production-ready for years and years. Memory-safe languages are here to replace unsafe ones like C++ and reduce the number of breaches you expose in prod
21.
by Kerollmops 2y ago
Thank you very much! We put a lot of effort into our documentation and be ready for the next version of our documentation coming soon. The experience will be even better and faster. We also put much effort recently into simplifying how peop
22.
by Kerollmops 2y ago
Nope, it doesn't. It's based on Cascade Ranking, also called [bucket sorting][1]. We released our new Hybrid search ranking system, combining the best full-text search results (our Cascade Ranking) with semantic results (with arro
23.
Vector Search at Scale: How open-source vector DBs compare(blog.kerollmops.com)
7 points by Kerollmops 2y ago|1 comments
24.
by Kerollmops 2y ago
Very interesting. I am wondering about the "level of translation". Is it using plain safe Rust or is it full of unsafe functions everywhere. I planned to port LMDB to Rust by hand "just to see" and it was an awful work.
25.
by Kerollmops 2y ago
I agree that thinking about code and your day-to-day work is not doing Vacations correctly. On the other hand, I hiked and spent time with my family and many dogs. It makes me think more out of the box than I usually do. Also, I like to wri
26.
by Kerollmops 2y ago
Hey, article author, co-founder and tech lead at Meilisearch here. If you have any questions, don't hesitate.
27.
Meilisearch Indexes Embeddings 7x Faster with Binary Quantization(blog.kerollmops.com)
4 points by Kerollmops 2y ago|0 comments
28.
Meilisearch Is Too Slow(github.com)
5 points by Kerollmops 2y ago|1 comments
29.
by Kerollmops 2y ago
> My main gripe is how slow to display their API documentation is. I don't know how they managed to make a text only website take 3 or 4 seconds per link. Fortunately, the Meilisearch documentation website is no longer the slowest w
30.
by Kerollmops 2y ago
Meilisearch only sends anonymized telemetry events. We only send API endpoints usage; nothing like raw documents goes through the wire. You can look at the exhaustive list of all collected data on our website [1]. [1]: https://ww

More ›