db-benchmarks VS qdrant

> I decided to experiment with this setup and the NY Taxi Dataset. The initial goal was to populate ElasticSearch with ~14 million rows, loading data from a compressed parquet file of ~350 MB.

> I tried multiple times, but the operation failed continuously, due to JVM memory constraints

Here's a script https://github.com/db-benchmarks/db-benchmarks/blob/main/tes... which loads 1.7B NYC taxi ride documents into Elasticsearch.

In general, you are correct about another missing key: since we added an exception for MySQL by including two keys, we should perhaps optimize it to the maximum and add the rest as well. However, it would be better to make this more visible directly within the results then. I've created a task about it https://github.com/db-benchmarks/db-benchmarks/issues/30 . Thank you for pointing this out. If you see more issues, feel free to file them on github.

> It's interesting to note that Elasticsearch and Opensearch are general purpose search engine, Solr as well. They are all powered by Lucene, the popular and performant search engine library.

Another search engine which can be considered general, is not based on Lucene and is not less powerful than Elasticsearch/Solr is Manticore Search [1]

[1]: https://github.com/manticoresoftware/manticoresearch

> I would love to see some benchmarks by category :)

I'd love too. We started this work on db-benchmarks [2] , hopefully we'll have resources to continue it. Contributions are very welcome. It's 100% opensource [3]

[2]: https://db-benchmarks.com/

Comparing full-text search engines on queries that aren't full-text search are of course slow, these tests should be adapted to the proper usage of the tested DBs and not just benchmarked across the board..

Example: https://db-benchmarks.com/?cache=fast_avg&engines=elasticsea...

Clickhouse: no tuning , just CREATE TABLE ... ENGINE = MergeTree() ORDER BY id and standard clickhouse-server docker image.

MySQL and Percona Server for MySQL: no tuning , just CREATE TABLE ..., FULLTEXT(story_text,story_author,comment_text,comment_author))and standard mysql docker image .

https://db-benchmarks.com is a platform and a framework for making the most fair, transparent and open source database and search engines benchmarks. No more benchmarketing, because:

Great. Now that we have the embeddings, we need to store them in a vector database. We will be using Qdrant for this purpose. Qdrant is an open-source vector database that allows you to store and query high-dimensional vectors. The easiest way to get started with the Qdrant database is using the docker.

I took Qdrant for this project. The reason was that Qdrant stands for high-performance vector search, the best choice against use cases like finding similar function calls based on semantic similarity. Qdrant is not only powerful but also scalable to support a variety of advanced search features that are greatly useful to nuanced caching mechanisms like ours.

I'm currently looking to implement locally, using QDrant [1] for instance.

I'm just playing around, but it makes sense to have a runnable example for our users at work too :) [2].

[1]. https://qdrant.tech/

Also compare with qdrant's Rust implementation; they tout their performance. https://github.com/qdrant/qdrant/tree/master/lib/segment/src...

There are much better known examples, such as https://qdrant.tech/ and https://github.com/lancedb/lancedb

For more information, see our release notes. Qdrant is an open source project. We welcome your contributions; raise issues, or contribute via pull requests!

Initialize the Qdrant Client with in-memory storage. The collection name will be “imagebind_data” and we will be using cosine distance.

Qdrant is an open-source vector search engine optimized for performance and flexibility. It supports both exact and approximate nearest neighbor search, providing a balance between accuracy and speed for various AI and ML applications.