Alternatives and similar repositories for BC-Tree

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

• wheatman / BP-Tree
  ☆15Updated 7 months ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 3 weeks ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆14Updated last year
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• gaurav16gupta / constrainedANN
  ☆12Updated 7 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 6 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 5 years ago
• viktorleis / vmcache
  ☆72Updated 5 months ago
• tuhhosg / exmap
  ☆48Updated last year
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆81Updated 3 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated 2 weeks ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆11Updated 3 months ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 5 months ago
• L-v-M / async
  ☆20Updated 2 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
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆58Updated 7 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆74Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆162Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆123Updated 10 months ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆103Updated 2 years ago