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 / 9 months ago

If you want to go larger you could still use some simple setup in conjunction with faiss, annoy or hnsw. Source: 11 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

AgentCloud uses Qdrant as the vector store to efficiently store and manage large sets of vector embeddings. For a given user query the RAG application fetches relevant documents from vector store by analyzing how similar their vector representation is compared to the query vector. - Source: dev.to / 21 days ago

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. - Source: dev.to / about 1 month ago

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. - Source: dev.to / about 1 month ago

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

There are much better known examples, such as https://qdrant.tech/ and https://github.com/lancedb/lancedb. - Source: Hacker News / 3 months ago