Alternatives and similar repositories for PBF

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

• 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
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 6 months ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆94Updated 2 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 9 months ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆39Updated 5 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆31Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 7 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 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)
  ☆84Updated 3 years ago
• carolinux / adaptive_range_filters
  ☆19Updated 9 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
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆15Updated 2 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• wheatman / BP-Tree
  ☆16Updated last year
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• naivewong / timeunion
  ☆12Updated 3 years ago