Alternatives and similar repositories for learned_indices

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

• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆149Updated 7 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆119Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆296Updated 3 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆48Updated 4 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆62Updated 3 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆20Updated last year
• karan1149 / DeepBloom
  An implementation of learned index structures for bloom filters.
  ☆23Updated 7 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆54Updated 3 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 3 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆36Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• wangziqi2016 / index-microbench
  ☆151Updated 2 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…
  ☆47Updated 6 months ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• luffy06 / NFL
  [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation
  ☆22Updated 2 years ago
• ustcadsl / unikv
  ☆27Updated 3 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 7 years ago
• BigDataAnalyticsGroup / GENE
  Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"
  ☆12Updated 3 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• BenTsai7 / SCM-DRAM-FPTree
  2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…
  ☆24Updated 6 years ago
• derFischer / Polyjuice
  ☆35Updated 10 months ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• thustorage / nvm-datastructure
  ☆50Updated 5 years ago
• yxymit / DBx1000
  ☆290Updated 3 years ago