Alternatives and similar repositories for hnsw

Users that are interested in hnsw are comparing it to the libraries listed below

• jbarrow / tinyhnsw
  build your own vector database -- the littlest hnsw
  ☆66Updated 10 months ago
• google / graph-mining
  ☆712Updated 3 months ago
• facebookresearch / vector_db_id_compression
  Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.
  ☆82Updated 10 months ago
• MinishLab / vicinity
  Lightweight Nearest Neighbors with Flexible Backends
  ☆316Updated last month
• recombee / beeformer
  Bridging the Gap Between Semantic and Interaction Similarity in Recommender Systems
  ☆106Updated 7 months ago
• dicroce / hnsw
  Heirarchical Navigable Small Worlds
  ☆101Updated 3 months ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆133Updated 2 months ago
• 1yefuwang1 / vectorlite
  Fast, SQL powered, in-process vector search for any language with an SQLite driver
  ☆329Updated last year
• wilsonzlin / CoreNN
  Embeddable library or single binary for indexing and searching 1B vectors
  ☆335Updated 5 months ago
• Dicklesworthstone / fast_vector_similarity
  The Fast Vector Similarity Library is designed to provide efficient computation of various similarity measures between vectors.
  ☆407Updated 8 months ago
• ScalingIntelligence / tokasaurus
  ☆455Updated 3 weeks ago
• google / unisim
  UniSim is a package for efficient similarity computation, fuzzy matching, and clustering of data.
  ☆144Updated 7 months ago
• carsonpo / haystackdb
  ☆165Updated last year
• jlscheerer / xtr-warp
  XTR/WARP (SIGIR'25) is an extremely fast and accurate retrieval engine based on Stanford's ColBERTv2/PLAID and Google DeepMind's XTR.
  ☆169Updated 6 months ago
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆172Updated last month
• idoh / mamba.np
  A pure NumPy implementation of Mamba.
  ☆223Updated last year
• cwida / PDX
  ⚡ Faster similarity search with PDX: A vertical data layout for vectors
  ☆60Updated 2 months ago
• unum-cloud / UStore
  Multi-Modal Database replacing MongoDB, Neo4J, and Elastic with 1 faster ACID solution, with NetworkX and Pandas interfaces, and bindings…
  ☆610Updated 2 years ago
• dais-polymtl / flock
  Flock: multimodal querying for DuckDB
  ☆280Updated 2 months ago
• mixedbread-ai / baguetter
  Baguetter is a flexible, efficient, and hackable search engine library implemented in Python. It's designed for quickly benchmarking, imp…
  ☆190Updated last year
• M4THYOU / TokenDagger
  High-Performance Implementation of OpenAI's TikToken.
  ☆460Updated 4 months ago
• mlecauchois / micrograd-cuda
  ☆248Updated last year
• beowolx / rensa
  High-performance MinHash implementation in Rust with Python bindings for efficient similarity estimation and deduplication of large datas…
  ☆215Updated last month
• guestrin-lab / ACORN
  state-of-the-art search over vector embeddings and structured data (SIGMOD '24)
  ☆90Updated 8 months ago
• rapidsai / cuvs
  cuVS - a library for vector search and clustering on the GPU
  ☆578Updated this week
• fzliu / radient
  Radient turns many data types (not just text) into vectors for similarity search, RAG, regression analysis, and more.
  ☆280Updated last month
• qdrant / ann-filtering-benchmark-datasets
  Collection of datasets for benchmarking filtered vector similarity retrieval
  ☆54Updated 5 months ago
• raphaelsty / neural-cherche
  Neural Search
  ☆365Updated 8 months ago
• qdrant / vector-db-benchmark
  Framework for benchmarking vector search engines
  ☆341Updated last week
• Dicklesworthstone / hoeffdings_d_explainer
  A Detailed Introduction to My Favorite Statistical Measure, Hoeffding's D
  ☆100Updated last year