Alternatives and similar repositories for DeepBloom:

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

• njulands / HashAdaptiveBF
  ☆16Updated 3 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
• ustcadsl / unikv
  ☆24Updated 2 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• DAIZHENWEI / Ada-BF
  ☆16Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year
• huanchenz / index-microbench
  ☆15Updated 7 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• zzy590 / article-code
  知乎文章附带代码
  ☆12Updated last year
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆27Updated 2 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• sfu-dis / pibench-ep2
  Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)
  ☆20Updated 2 years ago
• ustcadsl / diffkv
  ☆58Updated last year
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 3 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆36Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• amorten / openlis
  Python package that implements Learned Index Structures and provides database-like interface
  ☆18Updated 6 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 3 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆112Updated last year
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆20Updated 3 years ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆141Updated 6 years ago
• PDS-Lab / GearDB
  GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction
  ☆39Updated 5 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆74Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago