carolinux / adaptive_range_filters

Related projects: ⓘ

• huanchenz / index-microbench
  ☆14Updated 7 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆87Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 3 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆97Updated last year
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆35Updated 2 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 7 years ago
• flode / ARTSynchronized
  ☆114Updated 2 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆73Updated 2 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆49Updated 3 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 5 years ago
• cosmoss-jigu / pactree
  ☆26Updated 2 years ago
• derFischer / Polyjuice
  ☆34Updated 2 years ago
• njulands / HashAdaptiveBF
  ☆14Updated 3 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆44Updated last year
• ustcadsl / diffkv
  ☆58Updated last year
• thustorage / nvm-datastructure
  ☆46Updated 4 years ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• a993096281 / YCSB-HWDB
  YCSB-C for HWDB!
  ☆18Updated 4 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆28Updated 6 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 3 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 5 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆26Updated 2 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆110Updated last year
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 6 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆148Updated 3 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general way to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap, and…
  ☆26Updated 4 months 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 5 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year