Alternatives and similar repositories for PLEX:

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

• gdymind / Awesome-learned-index
  A set of learned index papers w/o notes
  ☆14Updated 9 months ago
• luffy06 / NFL
  [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation
  ☆19Updated last year
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆45Updated 2 years ago
• xiangyuzhi / GraphStorageExp
  ☆10Updated 8 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆53Updated 2 years ago
• curtis-sun / TLI
  ☆34Updated last year
• tawnysky / PLIN
  A persistent learned index for non-volatile memory with high read/write performance.
  ☆15Updated 2 years ago
• edydfang / Bourbon
  A Learned Index for Log-Structured Merge Trees
  ☆45Updated last year
• pfl-cs / DILI
  A Distribution-driven Learned Index
  ☆12Updated last year
• chaohcc / film
  a fully learned index for larger-than-memory databases
  ☆13Updated 2 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆30Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year
• rmitbggroup / LearnedIndexDiskExp
  ☆14Updated last year
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• qyliu-hkust / learnedbench
  ☆18Updated 2 years ago
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆17Updated 11 months ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆32Updated 3 years ago
• pfl-cs / LISA
  ☆39Updated 3 years ago
• wuziniu / FactorJoin
  A new cardinality estimation scheme for join query estimation
  ☆32Updated last month
• liumx10 / ICPP-RNTree
  ☆18Updated 5 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
• HNUSystemsLab / HashEvaluation
  ☆17Updated 2 years ago
• psiul / ICDE2019-GPU-Join
  Implementation of the algorithm described in "Hardware-conscious Hash-Joins on GPUs" paper presented in ICDE 2019
  ☆33Updated 4 years ago
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆38Updated 6 years ago
• thustorage / nvm-datastructure
  ☆47Updated 4 years ago
• JiananYuan / FITing-Tree
  An implementation of FITing-Tree learned index proposed in SIGMOD '19
  ☆9Updated last year
• cosmoss-jigu / pactree
  ☆28Updated 3 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year