Alternatives and similar repositories for HashAdaptiveBF

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

• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆39Updated 5 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• wheatman / BP-Tree
  ☆16Updated last year
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 6 months ago
• ukulililixl / openec
  ☆34Updated 6 months ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆49Updated 2 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…
  ☆48Updated 7 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 7 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• schencoding / lits
  LITS: An Optimized Learned Index for Strings
  ☆13Updated 7 months ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 2 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 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.
  ☆14Updated 2 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆62Updated 4 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 8 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 9 months ago
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• emperorlu / Learned-RocksDB
  ☆16Updated 2 years ago
• DAIZHENWEI / Ada-BF
  ☆16Updated 3 years ago
• luyi0619 / aria
  GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database
  ☆74Updated last year