Pith. sign in

REVIEW 1 cited by

Tsunami: A Learned Multi-dimensional Index for Correlated Data and Skewed Workloads

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 2006.13282 v1 pith:FCSOVB4T submitted 2020-06-23 cs.DB cs.LG

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

Filtering data based on predicates is one of the most fundamental operations for any modern data warehouse. Techniques to accelerate the execution of filter expressions include clustered indexes, specialized sort orders (e.g., Z-order), multi-dimensional indexes, and, for high selectivity queries, secondary indexes. However, these schemes are hard to tune and their performance is inconsistent. Recent work on learned multi-dimensional indexes has introduced the idea of automatically optimizing an index for a particular dataset and workload. However, the performance of that work suffers in the presence of correlated data and skewed query workloads, both of which are common in real applications. In this paper, we introduce Tsunami, which addresses these limitations to achieve up to 6X faster query performance and up to 8X smaller index size than existing learned multi-dimensional indexes, in addition to up to 11X faster query performance and 170X smaller index size than optimally-tuned traditional indexes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices

    cs.DB 2025-06 conditional novelty 5.0 of 10

    A unified benchmark shows learned indexes beat fence pointers on memory-latency tradeoff in LSM-trees, with position boundary and SSTable granularity as the key tuning knobs.

Pith tools