DBScholar

Back to papers

CrocSort: Resource-Efficient, Skew-Resilient Parallel External Merge Sort

Summary: CrocSort byte-balances external merge sort and analytically tunes memory and per-phase parallelism, avoiding wasteful over-allocation. Reused run sparse indexes provide skew-resilient partitioning, while offset-value codes reduce comparisons and intermediate I/O. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID
h6ac31c65698e9e9e
Venue
VLDB
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,850 | 27.08%
DOI
10.14778/3836663.3836667
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{otaki_vldb26,
        title = {{CrocSort: Resource-Efficient, Skew-Resilient Parallel External Merge Sort}},
        author = {Otaki, Riki and Benello, Charles and Zhao, Fuheng and Elmore, Aaron J. and Graefe, Goetz},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {11},
        pages = {2978--2991},
        doi = {10.14778/3836663.3836667},
        url = {https://doi.org/10.14778/3836663.3836667},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
83 Space-Efficient Online Computation of Quantile Summaries 2001 SIGMOD 0.00035962466
215 Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age 2014 SIGMOD 0.00024589307
253 Approximate Medians and other Quantiles in One Pass and with Limited Memory 1998 SIGMOD 0.00023047482
785 A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data 1997 VLDB 0.00013999898
1,116 A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort 2014 SIGMOD 0.00011957053
1,823 Memory Management during Run Generation in External Sorting 1998 SIGMOD 9.5571894e-05
2,213 Towards Cost-Optimal Query Processing in the Cloud 2021 VLDB 8.817248e-05
3,003 ClickHouse - Lightning Fast Analytics for Everyone 2024 VLDB 7.7631056e-05
3,674 FastSort: A Distributed Single-Input Single-Output External Sort 1990 SIGMOD 7.1065658e-05
3,708 The Case for a Learned Sorting Algorithm 2020 SIGMOD 7.0781032e-05
4,144 Memory-Contention Responsive Hash Joins 1994 VLDB 6.7782012e-05
4,471 Memory-Adaptive External Sorting 1993 VLDB 6.5823759e-05
4,694 Dynamic Memory Adjustment for External Mergesort 1997 VLDB 6.4643405e-05
5,048 KLL± Approximate Quantile Sketches over Dynamic Datasets 2021 VLDB 6.2971455e-05
5,326 A Tight Lower Bound for Comparison-Based Quantile Summaries 2020 PODS 6.1794406e-05
6,669 WiscSort: External Sorting For Byte-Addressable Storage 2023 VLDB 5.7131713e-05
7,703 SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model 2022 VLDB 5.4728588e-05
8,994 Resource-Adaptive Query Execution with Paged Memory Management 2025 CIDR 5.2408882e-05
9,355 External Merge Sort for Top-K Queries: Eager input filtering guided by histograms 2020 SIGMOD 5.1876576e-05
Previous Page 1 / 1 Next

Semantically Similar Papers