Alternatives and similar repositories for Effective_Modern_Cpp

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

• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• SJTU-IPADS / drtm
  Fast In-memory Transaction Processing using RDMA and HTM
  ☆58Updated 9 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• derFischer / Polyjuice
  ☆35Updated 4 months ago
• SJTU-IPADS / vegito
  ☆53Updated 2 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
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆75Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• tidb-incubator / vldbss-2021
  ☆21Updated 3 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• harvard-cns / Harvard-CNS-Seminar
  Reading seminar in Harvard Cloud Networking and Systems Group
  ☆16Updated 2 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 4 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆36Updated last week
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated last year
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆92Updated 2 years ago
• resource-disaggregation / snowset
  Snowflake dataset containing statistics for 70 million queries over 14 day period
  ☆113Updated 3 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆162Updated 4 years ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 3 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆32Updated 3 years ago
• SJTU-IPADS / drtmh
  Fast In-memory Transaction Processing using Hybrid RDMA Primitives
  ☆66Updated 6 years ago
• cloud-olap / FlexPushdownDB
  ☆72Updated 3 months ago
• readablesystems / sto
  Software Transactional Objects
  ☆58Updated last year
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆51Updated 4 years ago