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)
  ☆14Updated 3 years ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated last year
• njulands / HashAdaptiveBF
  ☆16Updated 3 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 6 years ago
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆48Updated last year
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• wheatman / BP-Tree
  ☆14Updated 2 months ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆13Updated 9 months ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆28Updated 3 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆23Updated 11 months ago
• HuangQiang / P2HNNS
  Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
  ☆13Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• naivewong / timeunion
  ☆13Updated 2 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated last year
• huanchenz / index-microbench
  ☆15Updated 7 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆12Updated last year
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year
• DBOS-project / dbos-scheduler
  ☆26Updated 3 years ago
• stonysystems / depfast-ae
  ☆18Updated last week
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆14Updated 5 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 7 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆41Updated 2 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year