Alternatives and similar repositories for b-epsilon-tree

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

• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆11Updated 3 months ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 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
• efficient / HOPE
  Order-preserving key encoder
  ☆124Updated 5 years ago
• flippingbits / cssl
  Cache-Sensitive Skip List.
  ☆22Updated 7 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆58Updated 8 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• tuhhosg / exmap
  ☆48Updated last year
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆46Updated 2 months ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• kunrenyale / CalvinDB
  Geo-replicated CalvinDB(Include the original CalvinDB and low latency version)
  ☆25Updated 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)
  ☆81Updated 3 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆109Updated last year
• tum-db / cachecoherence
  ☆12Updated 4 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
• wuwuz / Vacuum-Filter
  ☆52Updated 9 months ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆166Updated 3 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• twizzler-operating-system / twizzler-public
  Public-facing version of the Twizzler OS source code. Note: this is not completely up-to-date with internal Twizzler code.
  ☆65Updated 5 years ago