Pith. sign in

REVIEW 2 cited by

SOSD: A Benchmark for Learned Indexes

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 1911.13014 v1 pith:GA7ZLECD submitted 2019-11-29 cs.DB cs.DScs.LG

classification cs.DBcs.DScs.LG
keywords learnedstructuresindeximplementationsdataimprovingindexesmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A groundswell of recent work has focused on improving data management systems with learned components. Specifically, work on learned index structures has proposed replacing traditional index structures, such as B-trees, with learned models. Given the decades of research committed to improving index structures, there is significant skepticism about whether learned indexes actually outperform state-of-the-art implementations of traditional structures on real-world data. To answer this question, we propose a new benchmarking framework that comes with a variety of real-world datasets and baseline implementations to compare against. We also show preliminary results for selected index structures, and find that learned models indeed often outperform state-of-the-art implementations, and are therefore a promising direction for future research.

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