Alternatives and similar repositories for rabitq

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

• VectorDB-NTU / Extended-RaBitQ
  [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…
  ☆37Updated 3 months ago
• gaoj0017 / RaBitQ
  [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
  ☆107Updated this week
• danyangz / lightning
  Lightning In-Memory Object Store
  ☆46Updated 3 years ago
• facebookresearch / vector_db_id_compression
  Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.
  ☆80Updated 4 months ago
• zxjcarrot / libdbos
  Source code for Practical DB-OS Co-Design with Privileged Kernel Bypass
  ☆11Updated 4 months ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆37Updated 2 weeks ago
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆54Updated 4 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…
  ☆145Updated last week
• zilliztech / BBAnn
  Block-based Approximate Nearest Neighbor
  ☆35Updated 3 years ago
• intel / ScalableVectorSearch
  ☆163Updated this week
• microsoft / MSVBASE
  MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…
  ☆93Updated 6 months ago
• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 2 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆20Updated 2 weeks ago
• expert-kit / expert-kit
  Expert Kit is an efficient foundation of Expert Parallelism (EP) for MoE model Inference on heterogenous hardware
  ☆28Updated this week
• ds2-lab / infinistore
  InfiniStore: an elastic serverless cloud storage system (VLDB'23)
  ☆23Updated 2 years ago
• SJTU-IPADS / wukong-cube
  A distributed in-memory store for temporal knowledge graphs
  ☆10Updated last year
• hhy3 / pyanns
  🏆 The winner code for Neurips'23 BigANN Competition OOD and Sparse track.
  ☆10Updated last week
• mti-lab / rnn-descent
  ☆22Updated last year
• zhisbug / ray-scalable-ml-design
  Some microbenchmarks and design docs before commencement
  ☆12Updated 4 years ago
• ZJU-DAILY / HNSW-Flash
  Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"
  ☆14Updated 3 months ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆54Updated 4 years ago
• eth-easl / mixtera
  A lightweight, user-friendly data-plane for LLM training.
  ☆16Updated last month
• Trinity-data-store / Trinity
  EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"
  ☆18Updated 2 months ago
• zilliztech / starling
  ☆61Updated 9 months ago
• SJTU-IPADS / vegito
  ☆53Updated 2 years ago
• ThirdAIResearch / Dessert
  DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables
  ☆16Updated last year
• illinoisdata / airindex-public
  AirIndex: Versatile Index Tuning Through Data and Storage
  ☆10Updated 5 months ago
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 6 years ago
• datafusion-contrib / datafusion-dolomite
  Experimental DataFusion Optimizer
  ☆47Updated last year
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆55Updated last month