Pith. sign in

REVIEW 2 cited by

APEX: A High-Performance Learned Index on Persistent Memory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.00683 v3 pith:QJLZTI6Q submitted 2021-05-03 cs.DB

classification cs.DB
keywords indexeslearnedapexindexmemorypersistencedataexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The recently released persistent memory (PM) offers high performance, persistence, and is cheaper than DRAM. This opens up new possibilities for indexes that operate and persist data directly on the memory bus. Recent learned indexes exploit data distribution and have shown great potential for some workloads. However, none support persistence or instant recovery, and existing PM-based indexes typically evolve B+-trees without considering learned indexes. This paper proposes APEX, a new PM-optimized learned index that offers high performance, persistence, concurrency, and instant recovery. APEX is based on ALEX, a state-of-the-art updatable learned index, to combine and adapt the best of past PM optimizations and learned indexes, allowing it to reduce PM accesses while still exploiting machine learning. Our evaluation on Intel DCPMM shows that APEX can perform up to ~15x better than existing PM indexes and can recover from failures in ~42ms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Distributed Learned Hash Table

    cs.NI 2025-08 conditional novelty 6.0 of 10

    A learned order-preserving hash inside a Chord-style DHT lets range queries finish in roughly the same cost as single-key lookups, cutting latency and messages by 80-90%+ in tests.

  2. A New Paradigm in Tuning Learned Indexes: A Reinforcement Learning Enhanced Approach

    cs.DB 2025-02 conditional novelty 6.0 of 10

    A deep reinforcement learning framework with meta-learning, safety constraints, and online updating tunes learned index parameters, cutting runtime by up to 98% and raising throughput 17x in reported experiments.

Pith tools