Alternatives and similar repositories for BC-Tree:

Users that are interested in BC-Tree are comparing it to the libraries listed below

• HuangQiang / lccs-lsh
  LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)
  ☆15Updated 3 years ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 3 years ago
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆50Updated 2 months ago
• gaoj0017 / RaBitQ
  [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
  ☆88Updated 2 months ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆27Updated this week
• zilliztech / starling
  ☆56Updated 6 months ago
• wheatman / BP-Tree
  ☆14Updated 2 months ago
• VectorDB-NTU / Extended-RaBitQ
  [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…
  ☆25Updated last month
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• naivewong / timeunion
  ☆13Updated 3 years ago
• HuangQiang / P2HNNS
  Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
  ☆14Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆28Updated 3 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• ZJU-DAILY / HNSW-Flash
  Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"
  ☆12Updated last month
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 4 months ago
• CaucherWang / Steiner-hardness
  A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of yo…
  ☆15Updated last month
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆47Updated last year
• BU-DiSC / lethe-codebase
  ☆14Updated 3 years ago
• intel / ScalableVectorSearch
  ☆146Updated this week
• Lsyhprum / WEAVESS
  A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search
  ☆69Updated 3 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years 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…
  ☆137Updated last week
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆14Updated 11 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆55Updated 5 months ago