Skip to main content

Vector Databases

Vector databases are designed to efficiently handle vector data, which is prevalent in scenarios like embeddings generated by neural networks, feature vectors representing data points, and more. These databases often employ techniques such as indexing and search algorithms that are specifically tailored to work well with vector spaces. 

Here are some notable ones:

  1. Faiss:


    • Description: Faiss (Facebook AI Similarity Search) is an open-source library for efficient similarity search and clustering of dense vectors.
    • Link: Faiss GitHub Repository

  2. Milvus:


    • Description: Milvus is an open-source vector database designed for handling large-scale vector data. It is often used for similarity search and recommendation systems.
    • Link: Milvus GitHub Repository

  3. Annoy:


    • Description: Annoy is a C++ library with Python bindings for approximate nearest neighbors in high-dimensional spaces.
    • Link: Annoy GitHub Repository

  4. Elasticsearch with Vector Similarity Plugin:


    • Description: Elasticsearch is a widely used search and analytics engine. The Vector Similarity Plugin allows Elasticsearch to handle vector data and perform similarity searches.
    • Link: Vector Similarity Plugin GitHub Repository

  5. HNSW (Hierarchical Navigable Small World Graph):


    • Description: HNSW is a data structure and algorithm for approximate similarity search. It's often used in building vector databases for efficient nearest-neighbor search.
    • Link: HNSW GitHub Repository

Please note that the status, features, and popularity of these databases may have changed since my last update, and there may be new developments or databases introduced since then. Always refer to the respective repositories or official documentation for the latest information.

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

What is the difference between Elastic and Enterprise Redis w.r.t "Hybrid Query" capabilities

  We'll explore scenarios involving nested queries, aggregations, custom scoring, and hybrid queries that combine multiple search criteria. 1. Nested Queries ElasticSearch Example: ElasticSearch supports nested documents, which allows for querying on nested fields with complex conditions. Query: Find products where the product has a review with a rating of 5 and the review text contains "excellent". { "query": { "nested": { "path": "reviews", "query": { "bool": { "must": [ { "match": { "reviews.rating": 5 } }, { "match": { "reviews.text": "excellent" } } ] } } } } } Redis Limitation: Redis does not support nested documents natively. While you can store nested structures in JSON documents using the RedisJSON module, querying these nested structures with complex condi...
Post a Comment
Read more

Training LLM model requires more GPU RAM than storing same LLM

Storing an LLM model and training the same model both require memory, but the memory requirements for training are typically higher than just storing the model. Let's dive into the details: Memory Requirement for Storing the Model: When you store an LLM model, you need to save the weights of the model parameters. Each parameter is typically represented by a 32-bit float (4 bytes). The memory requirement for storing the model weights is calculated by multiplying the number of parameters by 4 bytes. For example, if you have a model with 1 billion parameters, the memory requirement for storing the model weights alone would be 4 GB (4 bytes * 1 billion parameters). Memory Requirement for Training: During the training process, additional components use GPU memory in addition to the model weights. These components include optimizer states, gradients, activations, and temporary variables needed by the training process. These components can require additional memory beyond just storing th...
Post a Comment
Read more

How are vector databases used?

  Vector Databases Usage: Typically used for vector search use cases such as visual, semantic, and multimodal search. More recently, they are paired with generative AI text models for conversational search experiences. Development Process: Begins with building an embedding model designed to encode a corpus (e.g., product images) into vectors. The data import process is referred to as data hydration. Application Development: Application developers utilize the database to search for similar products. This involves encoding a product image and using the vector to query for similar images. k-Nearest Neighbor (k-NN) Indexes: Within the model, k-nearest neighbor (k-NN) indexes facilitate efficient retrieval of vectors. A distance function like cosine is applied to rank results by similarity.
Post a Comment
Read more