Alternatives and similar repositories for BwTree:

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

• tikv / titan
  A RocksDB plugin for key-value separation, inspired by WiscKey.
  ☆497Updated 2 months ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆441Updated last year
• utsaslab / pebblesdb
  The PebblesDB write-optimized key-value store (SOSP 17)
  ☆514Updated last year
• stephentu / silo
  Multicore in-memory storage engine
  ☆386Updated 7 years ago
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆283Updated 4 years ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• yxymit / DBx1000
  ☆287Updated 2 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆229Updated this week
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 6 months ago
• pmem / pmemkv
  Key/Value Datastore for Persistent Memory
  ☆400Updated 2 years ago
• UncP / aili
  the fastest in-memory index in the East 东半球最快并发索引
  ☆473Updated 4 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆90Updated 2 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆263Updated last year
• ApsaraDB / PolarDB-FileSystem
  ☆203Updated last year
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆115Updated 2 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆198Updated last year
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆255Updated 6 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• leanstore / leanstore
  ☆532Updated this week
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆159Updated last year
• pmem / kvdk
  Key Value Development Kit
  ☆202Updated 6 months ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 6 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• efficient / SuRF
  First Practical and General-purpose Range Filter
  ☆542Updated 3 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• yongwen / columbia
  An efficient database query optimizer for large complex join queries
  ☆130Updated 2 years ago
• tikv / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆120Updated 3 weeks ago