towhee
ann-benchmarks
Our great sponsors
towhee | ann-benchmarks | |
---|---|---|
26 | 51 | |
2,989 | 4,588 | |
1.8% | - | |
8.6 | 8.1 | |
3 months ago | 3 days ago | |
Python | Python | |
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.
towhee
- FLaNK Stack Weekly for 14 Aug 2023
- Welcome to generate your embeddings with Towhee
-
Vector database built for scalable similarity search
As another commenter noted, Milvus is overkill and a "bit much" if you're learning/playing.
A good intro to the field with progression towards a full Milvus implementation could be starting with towhee[0] (which is also supported by Milvus).
towhee has an example to do exactly what you want with CLIP[1].
[0] - https://towhee.io/
[1] - https://github.com/towhee-io/examples/tree/main/image/text_i...
-
What Is DocArray?
The description of this is kind of confusing but I think the easiest way to understand it is that it is a data processing pipeline of sorts. Take unstructured data and apply transformation and computation. A similar project to this is Towhee (https://github.com/towhee-io/towhee). This project tries to simplify unstructured data processing and provides pretrained models and pipelines from their hub.
-
[P] My co-founder and I quit our engineering jobs at AWS to build “Tensor Search”. Here is why.
Milvus also has incredible flexibility when it comes to choosing an indexing strategy, and we also have a library specifically meant to help vectorize a variety of data called Towhee (https://github.com/towhee-io/towhee).
-
Deep Dive into Real-World Image Search Engine with Python
Benchmarking the models with towhee is as simple as:
-
A quick tip on DataFrame.apply
The project's homepage is https://github.com/towhee-io/towhee, and you can find more about towhee by going through the documents.
-
Build an Image Search Engine in Minutes
I made a tutorial for building an image search engine with python. The code example is as simple as 10 lines of code, using Towhee and Milvus To put images into the search engine:
-
Any good libraries for feature extraction?
Traditionally, I've done this through PyTorch by adding a hook, but this requires knowledge of the model itself (i.e. model arch and layer names). I found https://github.com/Hironsan/awesome-embedding-models but it didn't provide many CV-focused open-source projects. There's also https://github.com/towhee-io/towhee which is great but more targeted towards application development.
-
A python framework for unstructured data processing
You can check the result from the tutorial.
ann-benchmarks
-
Using Your Vector Database as a JSON (Or Relational) Datastore
On top of my head, pgvector only supports 2 indexes, those are running in memory only. They don't support GPU indexing, nor Disk based indexing, they also don't have separation of query and insertions.
Also with different people I've talked to, they struggle with scale past 100K-1M vector.
You can also have a look yourself from a performance perspective: https://ann-benchmarks.com/
- ANN Benchmarks
-
Approximate Nearest Neighbors Oh Yeah
https://ann-benchmarks.com/ is a good resource covering those libraries and much more.
-
pgvector vs Pinecone: cost and performance
We utilized the ANN Benchmarks methodology, a standard for benchmarking vector databases. Our tests used the dbpedia dataset of 1,000,000 OpenAI embeddings (1536 dimensions) and inner product distance metric for both Pinecone and pgvector.
-
Vector database is not a separate database category
Data warehouses are columnar stores. They are very different from row-oriented databases - like Postgres, MySQL. Operations on columns - e.g., aggregations (mean of a column) are very efficient.
Most vector databases use one of a few different vector indexing libraries - FAISS, hnswlib, and scann (google only) are popular. The newer vector dbs, like weaviate, have introduced their own indexes, but i haven't seen any performance difference -
Reference: https://ann-benchmarks.com/
-
How We Made PostgreSQL a Better Vector Database
(Blog author here). Thanks for the question. In this case the index for both DiskANN and pgvector HNSW is small enough to fit in memory on the machine (8GB RAM), so there's no need to touch the SSD. We plan to test on a config where the index size is larger than memory (we couldn't this time due to limitations in ANN benchmarks [0], the tool we use).
To your question about RAM usage, we provide a graph of index size. When enabling PQ, our new index is 10x smaller than pgvector HNSW. We don't have numbers for HNSWPQ in FAISS yet.
[0]: https://github.com/erikbern/ann-benchmarks/
- Do we think about vector dbs wrong?
-
Vector Search with OpenAI Embeddings: Lucene Is All You Need
In terms of "All You Need" for Vector Search, ANN Benchmarks (https://ann-benchmarks.com/) is a good site to review when deciding what you need. As with anything complex, there often isn't a universal solution.
txtai (https://github.com/neuml/txtai) can build indexes with Faiss, Hnswlib and Annoy. All 3 libraries have been around at least 4 years and are mature. txtai also supports storing metadata in SQLite, DuckDB and the next release will support any JSON-capable database supported by SQLAlchemy (Postgres, MariaDB/MySQL, etc).
-
Vector databases: analyzing the trade-offs
pg_vector doesn't perform well compared to other methods, at least according to ANN-Benchmarks (https://ann-benchmarks.com/).
txtai is more than just a vector database. It also has a built-in graph component for topic modeling that utilizes the vector index to autogenerate relationships. It can store metadata in SQLite/DuckDB with support for other databases coming. It has support for running LLM prompts right with the data, similar to a stored procedure, through workflows. And it has built-in support for vectorizing data into vectors.
For vector databases that simply store vectors, I agree that it's nothing more than just a different index type.
-
Vector Dataset benchmark with 1536/768 dim data
The reason https://ann-benchmarks.com is so good, is that we can see a plot of recall vs latency. I can see you have some latency numbers in the leaderboard at the bottom, but it's very difficult to make a decision.
As a practitioner that works with vector databases every day, just latency is meaningless to me, because I need to know if it's fast AND accurate, and what the tradeoff is! You can't have it both ways. So it would be helpful if you showed plots showing this tradeoff, similar to ann-benchmarks.
What are some alternatives?
qdrant - Qdrant - High-performance, massive-scale Vector Database for the next generation of AI. Also available in the cloud https://cloud.qdrant.io/
pgvector - Open-source vector similarity search for Postgres
Milvus - A cloud-native vector database, storage for next generation AI applications
faiss - A library for efficient similarity search and clustering of dense vectors.
examples - Analyze the unstructured data with Towhee, such as reverse image search, reverse video search, audio classification, question and answer systems, molecular search, etc.
PySceneDetect - :movie_camera: Python and OpenCV-based scene cut/transition detection program & library.
tlsh
AI - Artificial Intelligence Projects
vald - Vald. A Highly Scalable Distributed Vector Search Engine
pgANN - Fast Approximate Nearest Neighbor (ANN) searches with a PostgreSQL database.