hora
hnswlib
Our great sponsors
| hora | hnswlib | |
|---|---|---|
| 9 | 12 | |
| 2,552 | 3,984 | |
| 0.7% | 3.1% | |
| 0.0 | 6.6 | |
| 3 months ago | 28 days ago | |
| Rust | C++ | |
| 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.
hora
-
Building a Vector Database with Rust to Make Use of Vector Embeddings
We have been playing around with Hora as a replacement for the Rust-CV implementation as we want PQ as well. I'll check out instanct-distance, looks very interesting!
-
Faiss: A library for efficient similarity search
Maybe https://github.com/hora-search/hora but I've never used it
- An efficient library for nearest neighbor search in native rust
-
Hora, an blazingly fast AI Similarity search algorithm library (IOS Version)
$ rustup target add aarch64-apple-ios aarch64-apple-ios $ cargo install cargo-lipo $ git clone https://github.com/hora-search/hora-ios $ cd hora-ios/hora $ cargo lipo --release
- Hora: Efficient approximate nearest neighbor search algorithms in Rust
- [Project] Announcing Hora 0.1.1, an blazingly fast AI Similarity search algorithm library
- [Project] Announcing Hora 0.1.0, an blazingly fast approximate nearest neighbor search algorithm library
-
Announcing Hora 0.1.0, an approximate nearest neighbor search algorithm library in rust
github: https://github.com/hora-search/hora
hnswlib
-
Show HN: A fast HNSW implementation in Rust
How does this compare to hsnwlib - is it faster? https://github.com/nmslib/hnswlib
-
Show HN: Moodflix – a movie recommendation engine based on your mood
Last week I released Moodflix (https://moodflix.streamlit.app), a movie recommendation engine based to find movies based on your mood.
Moodflix was created on top of a movie dataset of 10k movies from The Movie Database. I vectorised the films using Hugging Face's T5 model (https://huggingface.co/docs/transformers/model_doc/t5) using the film's plot synopsis, genres and languages. Then I indexed the vectors using hnswlib (https://github.com/nmslib/hnswlib). LLMs can understand a movie's plot pretty well and distill the similarities between a user's query (mood) to the movie's plot and genres.
I have got feedback from close friends around linking movies to other review sites like IMDB or Rotten Tomatoes, linking movies to sites to stream the movie and adding movie posters. I would also love to hear from the community what things you like, what you want to see and what things you consider can be improved.
-
Hierarchical Navigable Small Worlds
Actually the "ef" is not epsilon. It is a parameter of the HNSW index: https://github.com/nmslib/hnswlib/blob/master/ALGO_PARAMS.md...
-
Vector Databases 101
If you want to go larger you could still use some simple setup in conjunction with faiss, annoy or hnsw.
-
[P] Compose a vector database
Many vector databases are using Hnswlib and that is a supported vector index alongside Faiss and Annoy.
-
Faiss: A library for efficient similarity search
hnswlib (https://github.com/nmslib/hnswlib) is a strong alternative to faiss that I have enjoyed using for multiple projects. It is simple and has great performance on CPU.
After working through several projects that utilized local hnswlib and different databases for text and vector persistence, I integrated hnswlib with sqlite to create an embedded vector search engine that can easily scale up to millions of embeddings. For self-hosted situations of under 10M embeddings and less than insane throughput I think this combo is hard to beat.
-
Storing OpenAI embeddings in Postgres with pgvector
https://github.com/nmslib/hnswlib
Used it to index 40M text snippets in the legal domain. Allows incremental adding.
I love how it just works. You know, doesn’t ANNOY me or makes a FAISS. ;-)
-
Seeking advice on improving NLP search results
3000 texts doesn't sound like to many, so may be a brute force cos calculation to find the most similar vector would work. If that's taking too much time, may be look at KNN or ANN modules to speed up finding the most similar vector. I use hsnwlib in knn mode for this. SOrt through about 350,000 vectors in about 30-50 msec.
-
How to Build a Semantic Search Engine in Rust
hnswlib is in cpp and has python bindings (you should be able to make your own for other languages).
-
Anatomy of a txtai index
embeddings - The embeddings index file. This is an Approximate Nearest Neighbor (ANN) index with either Faiss (default), Hnswlib or Annoy, depending on the settings.
What are some alternatives?
vald - Vald. A Highly Scalable Distributed Vector Search Engine
faiss - A library for efficient similarity search and clustering of dense vectors.
annoy - Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Milvus - A cloud-native vector database, storage for next generation AI applications
qdrant - Qdrant - High-performance, massive-scale Vector Database for the next generation of AI. Also available in the cloud https://cloud.qdrant.io/
instant-distance - Fast approximate nearest neighbor searching in Rust, based on HNSW index
awesome-vector-search - Collections of vector search related libraries, service and research papers
NumToA - An efficient method of heaplessly converting numbers into their string representations, storing the representation within a reusable byte array.
semantic-search-through-wikipedia-with-weaviate - Semantic search through a vectorized Wikipedia (SentenceBERT) with the Weaviate vector search engine
horapy - 🐍 Python bidding for the Hora Approximate Nearest Neighbor Search Algorithm library
txtai - 💡 All-in-one open-source embeddings database for semantic search, LLM orchestration and language model workflows