Alternatives and similar repositories for PBF

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

• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• wheatman / BP-Tree
  ☆13Updated 5 months ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆51Updated 4 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.
  ☆13Updated 2 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• naivewong / timeunion
  ☆12Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆153Updated 7 years ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 8 months ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• wangziqi2016 / index-microbench
  ☆146Updated 2 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 3 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 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)
  ☆80Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆92Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago