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 9 months ago
• google / graph-mining
  ☆709Updated 2 months ago
• Dicklesworthstone / fast_vector_similarity
  The Fast Vector Similarity Library is designed to provide efficient computation of various similarity measures between vectors.
  ☆406Updated 8 months ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆132Updated last month
• facebookresearch / vector_db_id_compression
  Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.
  ☆82Updated 9 months ago
• recombee / beeformer
  Bridging the Gap Between Semantic and Interaction Similarity in Recommender Systems
  ☆106Updated 7 months ago
• samvher / bert-for-laptops
  A BERT that you can train on a (gaming) laptop.
  ☆207Updated 2 years ago
• dicroce / hnsw
  Heirarchical Navigable Small Worlds
  ☆101Updated 2 months ago
• MinishLab / vicinity
  Lightweight Nearest Neighbors with Flexible Backends
  ☆312Updated 3 weeks ago
• guestrin-lab / ACORN
  state-of-the-art search over vector embeddings and structured data (SIGMOD '24)
  ☆87Updated 7 months ago
• softwaredoug / searcharray
  Full text search that feels like a numpy array
  ☆264Updated 3 weeks ago
• WPJiang / HWTL_SDU-ANNS
  ☆76Updated 9 months ago
• 1yefuwang1 / vectorlite
  Fast, SQL powered, in-process vector search for any language with an SQLite driver
  ☆323Updated 11 months ago
• google / unisim
  UniSim is a package for efficient similarity computation, fuzzy matching, and clustering of data.
  ☆142Updated 6 months ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆407Updated last week
• carsonpo / haystackdb
  ☆163Updated last year
• qdrant / vector-db-benchmark
  Framework for benchmarking vector search engines
  ☆339Updated last week
• 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…
  ☆170Updated last month
• raphaelsty / neural-cherche
  Neural Search
  ☆363Updated 7 months ago
• microsoft / DiskANN
  Graph-structured Indices for Scalable, Fast, Fresh and Filtered Approximate Nearest Neighbor Search
  ☆1,527Updated last week
• 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.
  ☆168Updated 6 months ago
• Dicklesworthstone / hoeffdings_d_explainer
  A Detailed Introduction to My Favorite Statistical Measure, Hoeffding's D
  ☆100Updated last year
• cwida / PDX
  ⚡ Faster similarity search with PDX: A vertical data layout for vectors
  ☆58Updated 2 months ago
• rentruewang / bocoel
  Bayesian Optimization as a Coverage Tool for Evaluating LLMs. Accurate evaluation (benchmarking) that's 10 times faster with just a few l…
  ☆285Updated last month
• rapidsai / cuvs
  cuVS - a library for vector search and clustering on the GPU
  ☆557Updated this week
• unum-cloud / UStore
  Multi-Modal Database replacing MongoDB, Neo4J, and Elastic with 1 faster ACID solution, with NetworkX and Pandas interfaces, and bindings…
  ☆608Updated 2 years ago
• idoh / mamba.np
  A pure NumPy implementation of Mamba.
  ☆223Updated last year
• joennlae / tensorli
  Absolute minimalistic implementation of a GPT-like transformer using only numpy (<650 lines).
  ☆254Updated last year
• zilliztech / knowhere
  Vector search engine inside Milvus, integrating FAISS, HNSW, DiskANN.
  ☆291Updated this week
• 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