Alternatives and similar repositories for fast-multi-join-sketch

Users that are interested in fast-multi-join-sketch are comparing it to the libraries listed below

• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆13Updated 2 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆19Updated last year
• wuziniu / FactorJoin
  A new cardinality estimation scheme for join query estimation
  ☆40Updated 8 months ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆289Updated 3 years ago
• wheatman / BP-Tree
  ☆15Updated 7 months ago
• zingdle / SIGMOD2020-MonetDB-Bindex
  BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
  ☆10Updated 5 years ago
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆14Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated 2 years ago
• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 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
• asu-cactus / netsdb
  A system that seamlessly integrates Big Data processing and machine learning model serving in distributed relational database
  ☆17Updated last year
• tidb-incubator / vldbss-2021
  ☆21Updated 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
• DataManagementLab / deepdb-public
  Implementation of DeepDB: Learn from Data, not from Queries!
  ☆103Updated 2 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆60Updated 3 years ago
• naivewong / timeunion
  ☆12Updated 3 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 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
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 3 weeks ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆148Updated 6 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆21Updated 4 months 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 2 months ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆53Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 2 years ago
• carolinux / adaptive_range_filters
  ☆19Updated 9 years ago
• Nathaniel-Han / End-to-End-CardEst-Benchmark
  A new CardEst Benchmark to Bridge AI and DBMS
  ☆130Updated 2 years ago