wuxb45 / lsm-trie

Related projects ⓘ

Alternatives and complementary repositories for lsm-trie

• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆97Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆172Updated 8 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆98Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆142Updated last year
• efficient / cicada-engine
  The Cicada engine
  ☆56Updated 7 years ago
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated last year
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆204Updated 8 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last month
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆102Updated 6 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 7 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆432Updated last year
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆176Updated 6 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆112Updated last year
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆88Updated 10 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 2 weeks ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆76Updated 2 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 7 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆86Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆150Updated 8 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.
  ☆149Updated 3 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 7 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆110Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 4 years ago