Alternatives and similar repositories for HashAdaptiveBF:

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

• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆47Updated last year
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 7 years ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 9 months ago
• ustcadsl / diffkv
  ☆58Updated last year
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• wheatman / BP-Tree
  ☆14Updated 3 weeks ago
• wuwuz / Vacuum-Filter
  ☆50Updated 2 months ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• CGCL-codes / DCF
  Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…
  ☆39Updated 7 years ago
• karan1149 / DeepBloom
  An implementation of learned index structures for bloom filters.
  ☆23Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆54Updated 3 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆31Updated 2 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 7 years ago
• carolinux / adaptive_range_filters
  ☆18Updated 8 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 2 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆27Updated 2 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆45Updated 2 years ago
• ustcadsl / depart
  ☆18Updated last year
• DominikHorn / hashing-benchmark
  benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
  ☆16Updated last year
• DAIZHENWEI / Ada-BF
  ☆16Updated 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…
  ☆33Updated 3 weeks ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆36Updated last year