tawnysky / PLINView external linksLinks
A persistent learned index for non-volatile memory with high read/write performance.
☆21Jun 16, 2022Updated 3 years ago
Alternatives and similar repositories for PLIN
Users that are interested in PLIN are comparing it to the libraries listed below
Sorting:
- High Performance Learned Index on Persistent Memory☆49Apr 19, 2023Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆37Apr 14, 2022Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆54Nov 9, 2022Updated 3 years ago
- ☆14Apr 8, 2023Updated 2 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆22Nov 1, 2023Updated 2 years ago
- LB+-Tree implementation☆49Apr 4, 2021Updated 4 years ago
- a fully learned index for larger-than-memory databases☆15Sep 17, 2022Updated 3 years ago
- WIPE implementation☆13Nov 26, 2023Updated 2 years ago
- An open-source FPTree implementation☆27May 4, 2022Updated 3 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆13Mar 31, 2022Updated 3 years ago
- Plush: A Write-Optimized Persistent Log-Structured Hash-Table☆18Jul 15, 2022Updated 3 years ago
- ☆18Sep 12, 2025Updated 5 months ago
- ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems☆80Jun 8, 2023Updated 2 years ago
- LITS: An Optimized Learned Index for Strings☆13Jun 18, 2025Updated 7 months ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆78Mar 7, 2022Updated 3 years ago
- Nap - NUMA-Aware Persistent Indexes☆41May 27, 2021Updated 4 years ago
- ☆50Aug 20, 2020Updated 5 years ago
- ☆30Nov 8, 2021Updated 4 years ago
- ☆11Dec 20, 2024Updated last year
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 4 years ago
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- Open source code of FAST' 24 paper, COLE: A Column-based Learned Storage for Blockchain Systems☆13Oct 23, 2024Updated last year
- A library for building an in-memory, Adaptive Learned indEX☆698Mar 12, 2024Updated last year
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- ☆17Sep 26, 2022Updated 3 years ago
- MioDB: Devouring Data Byte-addressable LSM-based KV Stores for Hybrid Memory☆18Jan 11, 2023Updated 3 years ago
- A Learned Index for Log-Structured Merge Trees☆47Sep 6, 2023Updated 2 years ago
- 🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of item…☆865Nov 28, 2024Updated last year
- Range Optimized Adaptive Radix Tree☆24Feb 1, 2023Updated 3 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆21Nov 15, 2022Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Jul 18, 2024Updated last year
- Porting PMFS to the latest Linux kernel☆17Feb 7, 2021Updated 5 years ago
- ☆57May 14, 2024Updated last year
- ☆28Oct 14, 2022Updated 3 years ago
- The recursive model index, a learned index structure☆230Oct 15, 2025Updated 3 months ago
- Ths is a fast RDMA abstraction layer that works both in the kernel and user-space.☆59Nov 12, 2024Updated last year
- This is the implementation repository of our OSDI'23 paper: SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory.☆63Oct 28, 2024Updated last year
- ☆30Sep 14, 2022Updated 3 years ago