Alternatives and similar repositories for IndexZoo

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

• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆105Updated 7 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 3 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 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…
  ☆46Updated 5 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 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
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 4 years ago
• wheatman / BP-Tree
  ☆15Updated 10 months ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 4 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• cloud-olap / FlexPushdownDB
  ☆74Updated 8 months ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 4 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 3 months ago