Zilliz (zilliz.com) | Hybrid/ONSITE (SF, NYC) | Full-time I am part of the hiring team for DevRel NYC - https://boards.greenhouse.io/zilliz/jobs/4307910005 SF - https://boards.greenhouse.io/zilliz/jobs/4317590005 Zilliz is the company behind Milvus (https://github.com/milvus-io/milvus), the most starred vector database on GitHub. Milvus is a distributed vector... - Source: Hacker News / 2 months ago

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. - Source: Hacker News / 4 months ago

Congrats to Qdrant's team, $28M for a Series is really nice. There are a lot of OSS vector search databases out there, we could probably list the main ones: - Qdrant https://github.com/qdrant/qdrant - Milvus https://github.com/milvus-io/milvus What else? - Source: Hacker News / 5 months ago

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 🥰. - Source: dev.to / 5 months ago

We are celebrating 25 different open source projects during the Open Source Advent this month! You can earn points all month long for a chance to win an exclusive swag pack from Zilliz and the participating projects! It’s a great chance to learn new skills and have some winter fun. Today is the first day and we are featuring Milvus! You can join us in our Discord channel or check us out on GitHub! We'd love a ⭐... - Source: dev.to / 6 months ago

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), an open source embeddings database. - Source: Hacker News / 10 months ago

If you want to go larger you could still use some simple setup in conjunction with faiss, annoy or hnsw. Source: 12 months ago

I then use annoy to compare them. Annoy can use different measures for distance, like cosine, euclidean and more. Source: about 1 year ago

Yes you can do this for equality predicates if your row groups are sorted . This blog post (that I didn't write) might add more color. You can't do this for any kind of text searching. If you need to do this with file based storage I'd recommend using a vector based text search and utilize a ANN index library like Annoy. Source: about 1 year ago

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). Source: about 1 year ago