Alternatives and similar repositories for b-tree

Users that are interested in b-tree are comparing it to the libraries listed below

• 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
• ustcadsl / unikv
  ☆27Updated 3 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆49Updated 2 years ago
• PDS-Lab / GearDB
  GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction
  ☆40Updated 6 years ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 8 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• sfu-dis / FPTree
  An open-source FPTree implementation
  ☆27Updated 3 years ago
• ACS-Storage-Group / FlexRaft-Code
  ☆12Updated last year
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 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
• schencoding / lbtree
  LB+-Tree implementation
  ☆49Updated 4 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 6 years ago
• Pfzuo / Path-Hashing
  A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)
  ☆30Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• CGCL-codes / mioDB
  MioDB: Devouring Data Byte-addressable LSM-based KV Stores for Hybrid Memory
  ☆18Updated 3 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• thustorage / nvm-datastructure
  ☆50Updated 5 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• Thesys-lab / fast23-GLCache
  Repository for FAST'23 paper GL-Cache: Group-level Learning for Efficient and High-Performance Caching
  ☆51Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• BenTsai7 / SCM-DRAM-FPTree
  2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…
  ☆24Updated 6 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 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