Database Paper Browser

Back to papers

Efficient String Sort with Multi-Character Encoding and Adaptive Sampling

Summary: Proposes a multi-character encoding to shrink radix in string sorting, leveraging sparse alphabet use and distinguishing-prefix sparsity. Paired with adaptive sampling, it blends radix sort with sample sort, delivering ~4.85x STL, ~1.5x state-of-the-art radix, and competitive parallel performance (pS5). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6209
Venue
SIGMOD
Year
2021
Pagerank
4.1945683e-05
Overall Rank
11,481 | 20.13%
DOI
10.1145/3448016.3457319

Incoming Non-self Citations Over Time

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

Authors

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 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4,042 PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort 2015 VLDB 6.5026989e-05
4,097 The Case for a Learned Sorting Algorithm 2020 SIGMOD 6.4551616e-05
Previous Page 1 / 1 Next

Semantically Similar Papers