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
• HuangQiang / P2HNNS
  Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
  ☆14Updated 3 years ago
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆28Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• wheatman / BP-Tree
  ☆13Updated 3 months ago
• gaurav16gupta / constrainedANN
  ☆12Updated 3 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆52Updated 3 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆47Updated 2 years ago
• illinoisdata / airindex-public
  AirIndex: Versatile Index Tuning Through Data and Storage
  ☆10Updated 4 months ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 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.
  ☆13Updated 2 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated 7 months ago
• gaoj0017 / RaBitQ
  [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
  ☆93Updated 3 weeks ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 6 months ago
• zilliztech / starling
  ☆60Updated 8 months ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆33Updated 3 months ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆36Updated 3 weeks ago