rafaelkallis / adaptive-radix-tree

Related projects ⓘ

Alternatives and complementary repositories for adaptive-radix-tree

• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆172Updated 8 years ago
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆246Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆142Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆98Updated 8 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆102Updated 6 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆40Updated 2 weeks 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
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆110Updated 3 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆42Updated 6 months ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last month
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆263Updated 10 months ago
• peterboncz / bloomfilter-repro
  ☆19Updated 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)
  ☆76Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated last month
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆108Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆97Updated 6 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆112Updated last year
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆87Updated last year
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 2 weeks ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 6 months ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆73Updated 2 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
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆152Updated 3 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated last year
• epfl-labos / TRIAD
  ☆43Updated 3 years ago