Alternatives and similar repositories for lipp:

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

• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆45Updated 2 years ago
• luffy06 / NFL
  [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation
  ☆19Updated last year
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆31Updated 2 years ago
• tawnysky / PLIN
  A persistent learned index for non-volatile memory with high read/write performance.
  ☆15Updated 2 years ago
• curtis-sun / TLI
  ☆36Updated last year
• chaohcc / film
  a fully learned index for larger-than-memory databases
  ☆13Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆47Updated last year
• rmitbggroup / LearnedIndexDiskExp
  ☆14Updated last year
• pfl-cs / DILI
  A Distribution-driven Learned Index
  ☆12Updated last year
• edydfang / Bourbon
  A Learned Index for Log-Structured Merge Trees
  ☆45Updated last year
• gdymind / Awesome-learned-index
  A set of learned index papers w/o notes
  ☆14Updated 9 months ago
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆17Updated 11 months ago
• pfl-cs / LISA
  ☆39Updated 3 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• madsys-dev / ROART
  Range Optimized Adaptive Radix Tree
  ☆22Updated 2 years ago
• qyliu-hkust / learnedbench
  ☆19Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆104Updated 4 months ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆144Updated 6 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
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆72Updated last year
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆38Updated 6 years ago
• thustorage / perseid
  Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory
  ☆17Updated last year
• cds-ruc / SALI
  ☆12Updated last year
• thustorage / pacman
  Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory
  ☆43Updated 2 years ago
• DominikHorn / hashing-benchmark
  benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
  ☆16Updated last year
• thustorage / osdi21ae
  Nap - NUMA-Aware Persistent Indexes
  ☆41Updated 3 years ago
• HNUSystemsLab / HashEvaluation
  ☆17Updated 2 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆274Updated 2 years ago