Milvus
annoy
Our great sponsors
Milvus | annoy | |
---|---|---|
103 | 40 | |
26,298 | 12,592 | |
3.5% | 1.5% | |
10.0 | 5.3 | |
about 12 hours ago | about 2 months ago | |
Go | 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.
Milvus
-
Milvus VS pgvecto.rs - a user suggested alternative
2 projects | 13 Mar 2024
-
How to choose the right type of database
Milvus: An open-source vector database designed for AI and ML applications. It excels in handling large-scale vector similarity searches, making it suitable for recommendation systems, image and video retrieval, and natural language processing tasks.
-
Simplifying the Milvus Selection Process
Github Repository
Selecting the right version of open-source Milvus is important to the success of any project leveraging vector search technology. With Milvus offering different versions of its vector database tailored to varying requirements, understanding the significance of selecting the correct version is key for achieving desired outcomes.
-
7 Vector Databases Every Developer Should Know!
Milvus is an open-source vector database designed to handle large-scale similarity search and vector indexing. It supports multiple index types and offers highly efficient search capabilities, making it suitable for a wide range of AI and ML applications, including image and video recognition, natural language processing, and recommendation systems.
-
Ask HN: Who is hiring? (February 2024)
Zilliz is hiring! We're looking for REMOTE and/or HYBRID roles in SF
Zilliz is the company behind Milvus (https://github.com/milvus-io/milvus), the most widely adopted vector database. Vector databases are a crucial piece of any technology stack looking to take advantage of unstructured data. Most recently and notably, Retrieval Augmented Generation (RAG). For RAG, vector databases like Milvus are used as the tool to inject customized data. In other words, vector databases make things like customized chat bots, personalized product recommendations, and more possible.
We are hiring for Developer Advocates, Senior+ Level Engineers and Product people, and Talent Acquisition. Check out all the roles here: https://zilliz.com/careers
-
Qdrant, the Vector Search Database, raised $28M in a Series A round
Good on them, I know the crustaceans are out here happy about this raise for a Rust based Vector DB!
(now I'm gonna plug what I work on)
If you're interested in a more scalable vector database written in Go, check out Milvus (https://github.com/milvus-io/milvus)
-
Open Source Advent Fun Wraps Up!
But before we do, I do want to say that 🤩 all these lovely Open-Source projects would love a little 🎉💕 love by getting a GitHub star ⭐ for their efforts. Including Open Source Milvus 🥰
-
First 15 Open Source Advent projects
1. Milvus by Zilliz | Github
annoy
-
Do we think about vector dbs wrong?
The focus on the top 10 in vector search is a product of wanting to prove value over keyword search. Keyword search is going to miss some conceptual matches. You can try to work around that with tokenization and complex queries with all variations but it's not easy.
Vector search isn't all that new a concept. For example, the annoy library (https://github.com/spotify/annoy) has been around since 2014. It was one of the first open source approximate nearest neighbor libraries. Recommendations have always been a good use case for vector similarity.
Recommendations are a natural extension of search and transformers models made building the vectors for natural language possible. To prove the worth of vector search over keyword search, the focus was always on showing how the top N matches include results not possible with keyword search.
In 2023, there has been a shift towards acknowledging keyword search also has value and that a combination of vector + keyword search (aka hybrid search) operates in the sweet spot. Once again this is validated through the same benchmarks which focus on the top 10.
On top of all this, there is also the reality that the vector database space is very crowded and some want to use their performance benchmarks for marketing.
Disclaimer: I am the author of txtai (https://github.com/neuml/txtai), an open source embeddings database
-
Vector Databases 101
If you want to go larger you could still use some simple setup in conjunction with faiss, annoy or hnsw.
- I'm an undergraduate data science intern and trying to run kmodes clustering. Did this elbow method to figure out how many clusters to use, but I don't really see an "elbow". Tips on number of clusters?
-
[D]: Best nearest neighbour search for high dimensions
If you need large scale (1000+ dimension, millions+ source points, >1000 queries per second) and accept imperfect results / approximate nearest neighbors, then other people have already mentioned some of the best libraries (FAISS, Annoy).
-
Faiss: A library for efficient similarity search
I like Faiss but I tried Spotify's annoy[1] for a recent project and was pretty impressed.
Since lots of people don't seem to understand how useful these embedding libraries are here's an example. I built a thing that indexes bouldering and climbing competition videos, then builds an embedding of the climber's body position per frame. I then can automatically match different climbers on the same problem.
It works pretty well. Since the body positions are 3D it works reasonably well across camera angles.
The biggest problem is getting the embedding right. I simplified it a lot above because I actually need to embed the problem shape itself because otherwise it matches too well: you get frames of people in identical positions but on different problems!
-
How to find "k" nearest embeddings in a space with a very large number of N embeddings (efficiently)?
If you just want quick in memory search then pynndescent is a decent option: it's easy to install, and easy to get running. Another good option is Annoy; it's just as easy to install and get running with python, but it is a little less performant if you want to do a lot of queries, or get a knn-graph quickly.
- [D] Algorithms for efficiently computing the approximate nearest neighbour from a large bag of elements
-
[Discussion] NLP for products matching
Probably I won't be bale to explain better than it's stated on annoy page: https://github.com/spotify/annoy But the bottom line is speed. Instead of computing similarities of embeddings one by one you do it via index that works way faster.
-
Do i really need a vector database
Perhaps you can store your embeddings anywhere (sql or even a file) and use Approximate Nearest Neighbors like https://github.com/spotify/annoy for comparison?
What are some alternatives?
faiss - A library for efficient similarity search and clustering of dense vectors.
pgvector - Open-source vector similarity search for Postgres
qdrant - Qdrant - High-performance, massive-scale Vector Database for the next generation of AI. Also available in the cloud https://cloud.qdrant.io/
Weaviate - Weaviate is an open-source vector database that stores both objects and vectors, allowing for the combination of vector search with structured filtering with the fault tolerance and scalability of a cloud-native database.
Elasticsearch - Free and Open, Distributed, RESTful Search Engine
Face Recognition - The world's simplest facial recognition api for Python and the command line
hnswlib - Header-only C++/python library for fast approximate nearest neighbors
vald - Vald. A Highly Scalable Distributed Vector Search Engine
implicit - Fast Python Collaborative Filtering for Implicit Feedback Datasets
nmslib - Non-Metric Space Library (NMSLIB): An efficient similarity search library and a toolkit for evaluation of k-NN methods for generic non-metric spaces.
CompreFace - Leading free and open-source face recognition system