Alternatives and similar repositories for SIGMOD2020-MonetDB-Bindex

Users that are interested in SIGMOD2020-MonetDB-Bindex are comparing it to the libraries listed below

• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 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
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆296Updated 3 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 4 months ago
• ldbc / dbgen.JCC-H
  ☆20Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 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
• UWHustle / HATtrick
  ☆35Updated 3 years ago
• cloud-olap / FlexPushdownDB
  ☆74Updated 8 months ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 8 months ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆149Updated 6 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆62Updated 3 years ago
• yxymit / DBx1000
  ☆290Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 4 years ago
• viktorleis / vmcache
  ☆77Updated 3 months ago
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 4 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 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 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆14Updated 2 years ago