lucene
faiss
Our great sponsors
lucene | faiss | |
---|---|---|
11 | 70 | |
2,358 | 28,054 | |
4.0% | 3.8% | |
9.8 | 9.4 | |
about 12 hours ago | 7 days ago | |
Java | C++ | |
Apache License 2.0 | MIT License |
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.
lucene
-
Building an efficient sparse keyword index in Python
First, a review of the landscape. As said in the introduction, there aren't a ton of good options. Apache Lucene is by far the best traditional search index from a speed, performance and functionality standpoint. It's the base for Elasticsearch/OpenSearch and many other projects. But it requires Java.
-
Java Panama Vector API Integrated with Apache Lucene
https://github.com/apache/lucene/issues/10047
2. The Panama Vector API allows CPU's that support it to accelerate vector operations: https://openjdk.org/jeps/438
So this allows fast ANN on Lucene for semantic search!
How did people do this before Lucene supported it? Only through entirely different tools?
-
What Is a Vector Database
Are they forking Lucene or somehow getting the Lucene devs to increase that limit? Because this PR has been open for over a year now: https://github.com/apache/lucene/issues/11507
- An alternative to Elasticsearch that runs on a few MBs of RAM
- Lucene 9.4 (optionally) uses Panama's mapped MemorySegments when JDK 19 is detected
-
A primer on Roaring bitmaps: what they are and how they work
Lucene's adaptation of Roaring uses the complement idea on a block-wise basis:
https://github.com/apache/lucene/blob/84cae4f27cfd3feb3bb42d...
-
How are documents stored in Elasticsearch?
Like someone said, it's in locations as specified in the path.data. Depending on sharing and replication, it could be on more than one host. Elastic uses Apache Lucene to store documents, since it's open source, that rabbit hole will welcome research :-)
- panama/foreign status update
-
Amazon Elasticsearch Service Is Now Amazon OpenSearch Service
It is pretty clear to me that Elastic is planning to build their ANN features differently than OpenDistro's k-NN implementation, or other plugins modules that extend Easticsearch in similar ways. They now will build on the Apache Lucene capabilities that were collaboratively built "upstream" by a number of individuals, some that work for Amazon and some that work for Elastic.
From the linked issue, it seemed that they were originally planning to develop this as a proprietary feature of Elasticsearch, without contributing the functionality to Apache Lucene, but then changed direction when the Apache Lucene developers (some of which are currently employed to do such work by Amazon) started to build its approximate nearest neighbor (ANN) vector search capabilities. [1]
It's great to see folks that work for Elastic collaborating and building on what is in Apache Lucene to extend the utility of ANN with Hierarchical Navigable Small World Graphs (HNSW) [2]! From this, I think it should be possible to implement an Open Source version of the functionality with a compatible API, if that is something that OpenSearch users seek.
[1] https://issues.apache.org/jira/browse/LUCENE-9004
[2] https://github.com/apache/lucene/pull/250
faiss
-
Show HN: Chromem-go – Embeddable vector database for Go
Or just use FAISS https://github.com/facebookresearch/faiss
- OpenAI: New embedding models and API updates
-
You Shouldn't Invest in Vector Databases?
You can try txtai (https://github.com/neuml/txtai) with a Faiss backend.
This Faiss wiki article might help (https://github.com/facebookresearch/faiss/wiki/Indexing-1G-v...).
For example, a partial Faiss configuration with 4-bit PQ quantization and only using 5% of the data to train an IVF index is shown below.
faiss={"components": "IVF,PQ384x4fs", "sample": 0.05}
-
Approximate Nearest Neighbors Oh Yeah
If you want to experiment with vector stores, you can do that locally with something like faiss which has good platform support: https://github.com/facebookresearch/faiss
Doing full retrieval-augmented generation (RAG) and getting LLMs to interpret the results has more steps but you get a lot of flexibility, and there's no standard best-practice. When you use a vector DB you get the most similar texts back (or an index integer in the case of faiss), you then feed those to an LLM like a normal prompt.
The codifer for the RAG workflow is LangChain, but their demo is substantially more complex and harder-to-use than even a homegrown implementation: https://news.ycombinator.com/item?id=36725982
-
Can someone please help me with this problem?
According to this documentation page, faiss-gpu is only supported on Linux, not on Windows.
-
Ask HN: Are there any unsolved problems with vector databases
Indexes for vector databases in high dimensions are nowhere near are effective as the 2-d indexes used in GIS or the 1-d B-tree indexes that are commonly used in databases.
Back around 2005 I was interested in similarity search and read a lot of conference proceedings on the top and was basically depressed at the state of vector database indexes and felt that at least for the systems I was prototyping I was OK with a full scan and later in 2013 I had the assignment of getting a search engine for patents using vector embeddings in front of customers and we got performance we found acceptable with full scan.
My impression today is that the scene is not too different than it was in 2005 but I can't say I haven't missed anything. That is, you have tradeoffs between faster algorithms that miss some results and slower algorithms that are more correct.
I think it's already a competitive business. You have Pinecone which had the good fortune of starting before the gold rush. Many established databases are adding vector extension. I know so many engineering managers who love postgresql and they're just going to load a vector extension and go. My RSS reader YOShInOn uses SBERT embeddings to cluster and classify text and certainly More Like This and semantic search are on the agenda, I'd expect it to take about an hour to get
https://github.com/facebookresearch/faiss
up and working, I could spend more time stuck on some "little" front end problem like getting something to look right in Bootstrap than it would take to get working.
I can totally believe somebody could make a better vector db than what's out there but will it be better enough? A startup going through YC now could spend 2-3 to get a really good product and find customers and that is forever in a world where everybody wants to build AI applications right now.
-
Code Search with Vector Embeddings: A Transformer's Approach
As the size of the codebase grows, storing and searching through embeddings in memory becomes inefficient. This is where vector databases come into play. Tools like Milvus, Faiss, and others are designed to handle large-scale vector data and provide efficient similarity search capabilities. I've wrtten about how to also use sqlite to store vector embeddings. By integrating a vector database, you can scale your code search tool to handle much larger codebases without compromising on search speed.
-
Unum: Vector Search engine in a single file
But FAISS has their own version ("FastScan") https://github.com/facebookresearch/faiss/wiki/Fast-accumula...
-
Introduction to Vector Similarity Search
https://github.com/facebookresearch/faiss
-
Any Suggestions on good open source model for Document QA which we can run on prod ? 13b + models?
Not a model, but I would use this Dense Passage Retrieval for Open Domain QA simply fine-tuning two BERT models, one for questions and one for queries, and then fine-tuning using contrastive loss between positive key/value pairs of document embeddings (the [CLS]) token. You can then use a vector database (Like Faiss, Elasticsearch, Vespa or similar) for querying the question.
What are some alternatives?
pisa - PISA: Performant Indexes and Search for Academia
annoy - Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Typesense - Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences
Milvus - A cloud-native vector database, storage for next generation AI applications
RoaringBitmap - A better compressed bitset in Java: used by Apache Spark, Netflix Atlas, Apache Pinot, Tablesaw, and many others
hnswlib - Header-only C++/python library for fast approximate nearest neighbors
OpenSearch - 🔎 Open source distributed and RESTful search engine.
pgvector - Open-source vector similarity search for Postgres
Apache Solr - Apache Lucene and Solr open-source search software
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.
resin - Vector space search engine. Available as a HTTP service or as an embedded library.
qdrant - Qdrant - High-performance, massive-scale Vector Database for the next generation of AI. Also available in the cloud https://cloud.qdrant.io/