Alternatives and similar repositories for hashing-benchmark:

Users that are interested in hashing-benchmark are comparing it to the libraries listed below

• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆56Updated 3 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆51Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆47Updated last year
• curtis-sun / TLI
  ☆40Updated last year
• luffy06 / NFL
  [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation
  ☆20Updated last year
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆32Updated 3 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆17Updated last year
• pfl-cs / LISA
  ☆39Updated 3 years ago
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆38Updated last year
• chaohcc / film
  a fully learned index for larger-than-memory databases
  ☆14Updated 2 years ago
• edydfang / Bourbon
  A Learned Index for Log-Structured Merge Trees
  ☆45Updated last year
• madsys-dev / ROART
  Range Optimized Adaptive Radix Tree
  ☆23Updated 2 years ago
• BigDataAnalyticsGroup / GENE
  Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"
  ☆10Updated 3 years ago
• tawnysky / PLIN
  A persistent learned index for non-volatile memory with high read/write performance.
  ☆15Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• chahk0129 / Blink-hash
  Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases
  ☆21Updated 2 years ago
• qyliu-hkust / learnedbench
  ☆19Updated 2 years ago
• aysusayin / FITing-Tree
  FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…
  ☆11Updated 3 years ago
• rmitbggroup / LearnedIndexDiskExp
  ☆14Updated 2 years ago
• ustcadsl / diffkv
  ☆59Updated 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…
  ☆33Updated 2 months ago
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆19Updated 3 years ago
• Eilowangfang / LPCE
  This is for SIGMOD submission "Learning-based Progressive Cardinality Estimation for End-to-end Query Execution"
  ☆18Updated 2 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆75Updated 3 years ago
• pfl-cs / DILI
  A Distribution-driven Learned Index
  ☆14Updated last year
• andreaskipf / learnedcardinalities
  Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)
  ☆121Updated 5 years ago
• sfu-db / AreCELearnedYet
  ☆70Updated 2 years ago
• learnedsystems / CEB
  Cardinality Estimation Benchmark
  ☆78Updated last year