instant-distance
vector-db-benchmark
| instant-distance | vector-db-benchmark | |
|---|---|---|
| 7 | 6 | |
| 281 | 227 | |
| 0.4% | 6.7% | |
| 5.6 | 9.1 | |
| about 1 month ago | 2 days ago | |
| Rust | Python | |
| Apache License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
instant-distance
- Show HN: A fast HNSW implementation in Rust
-
Hierarchical Navigable Small Worlds
https://github.com/instant-labs/instant-distance is a compact, fairly readable, pretty fast implementation of the paper in Rust.
-
Building a Vector Database with Rust to Make Use of Vector Embeddings
When I looked at it the Rust-CV HNSW implementation was pretty messy, and it looks like it hasn't seen any commits in 2 years. This is partly why we started instant-distance as an alternative, which I think has come out pretty well (for the particular use cases that it serves).
-
DiskANN Pure Rust Implementation Interest
I believe u/dochtman's implementation of HNSW is about as good as HNSW is going to get. Competing with the scalability and features (like streamed updates) of FAISS is what I hope to accomplish with this project. Based on interest, I'm now leaning towards an MIT license for the implementation.
- Approaches to looking up data in 2d space
-
Hierarchical Navigable Small Worlds (HNSW)
I wrote an HNSW implementation in pure Rust:
https://github.com/InstantDomain/instant-distance
It works pretty well for us at InstantDomainSearch.
I like to think that this is a fairly idiomatic Rust implementation so it might be easier to follow than Facebook's FAISS. It's kinda similar in design to FAISS, so I think it might achieve similar performance, though we haven't spent enough time benchmarking yet.
-
Using Aligned Word Vectors for Instant Translations with Python and Rust
We've released the underlying Rust implementation here: https://github.com/InstantDomain/instant-distance with Python bindings at https://pypi.org/project/instant-distance — feedback welcome!
vector-db-benchmark
-
RAG is Dead. Long Live RAG!
Qdrant’s benchmark results are strongly in favor of accuracy and efficiency. We recommend that you consider them before deciding that an LLM is enough. Take a look at our open-source benchmark reports and try out the tests yourself.
-
Evaluate Vector Database / Benchmarks?
Qdrant made their own benchmark. It is quite simple and also takes into consideration more options, so it should be better suited for benchmarking for production purposes.
-
Qdrant, Pinecone, Supabase
is noWhen it comes to Supabase, it's using pgvector under the hood, so it would make sense to benchmark it with the other Open Source tools. There is an open PR for that, but it's pretty old: https://github.com/qdrant/vector-db-benchmark/pull/50
-
Building a Vector Database with Rust to Make Use of Vector Embeddings
P.S.: Perhaps you want to add your database to our benchmarks repo?
-
New and Improved Embedding Model for OpenAI
Do we have any idea why lucene vector search underperforms? As of lucene 9.1 (and elastic 8.4), it runs the same sort of filtered/categorical HNSW that qdrant runs (https://lucene.apache.org/core/9_1_0/core/org/apache/lucene/...). Qdrant's benchmarking code (https://github.com/qdrant/vector-db-benchmark/blob/9263ba/en...) does use the new filtered ann query with elastic 8.4, so it appears to be a fair benchmark. Why is lucene/elastic so much slower? Is it a rust vs. java thing? Or some memory management issues?
-
Which vector search engine is the fastest?
There is also an open-source framework for benchmarking https://github.com/qdrant/vector-db-benchmark
What are some alternatives?
hora - 🚀 efficient approximate nearest neighbor search algorithm collections library written in Rust 🦀 .
citrus - (distributed) vector database
hnswlib - Header-only C++/python library for fast approximate nearest neighbors
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
bat - A cat(1) clone with wings.
vector-search - The definitive guide to using Vector Search to solve your semantic search production workload needs.
rust - Empowering everyone to build reliable and efficient software.
qdrant - Qdrant - High-performance, massive-scale Vector Database for the next generation of AI. Also available in the cloud https://cloud.qdrant.io/
weaviate-examples - Weaviate vector database – examples
arroy - Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage :boom: