The Case for a Learned Sorting Algorithm
Summary: A learned distribution sort maps keys to positions via a CDF model, then finishes with a near-sorted pass. Up to 1B doubles, normally distributed, it yields 3.38x STL, 1.49x Radix, 5.54x TimSort, showing learned sorting as a practical primitive. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ani Kristo
- 2. Kapil Vaidya
- 3. Uğur Çetintemel
- 4. Sanchit Misra
- 5. Tim Kraska
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,460 | A Study of Sort Algorithms for Multiprocessor Database Machines | 1986 | VLDB | 4.7241128e-05 |
| 946 | Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture | 2008 | VLDB | 0.0001513324 |
| 1,460 | Benchmarking Learned Indexes | 2021 | VLDB | 0.00011887068 |
| 1,607 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD | 0.00011162682 |
| 6,174 | Percentile Finding Algorithm for Multiple Sorted Runs | 1989 | VLDB | 5.1696569e-05 |
| 930 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD | 0.00015238545 |
| 4,655 | SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures | 2015 | VLDB | 6.0221672e-05 |
| 11,832 | A Study of Sorting Algorithms on Approximate Memory | 2016 | SIGMOD | 4.1945683e-05 |
| 3,151 | A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs | 2017 | SIGMOD | 7.4720668e-05 |
| 11,481 | Efficient String Sort with Multi-Character Encoding and Adaptive Sampling | 2021 | SIGMOD | 4.1945683e-05 |