Percentile Finding Algorithm for Multiple Sorted Runs
Summary: Introduces an exact percentile-finding algorithm for multiple sorted runs to enable load-balanced parallel merges in external sort. By removing sort-key skew with an exact percentile method, it improves parallel sort speedup on shared-memory MIMD architectures; analysis and proofs are provided. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,121 | Improving the Performance of List Intersection | 2009 | VLDB | 0.00013838956 |
| 3,660 | CloudRAMSort: Fast and Efficient Large-Scale Distributed RAM Sort on Shared-Nothing Cluster | 2012 | SIGMOD | 6.8683099e-05 |
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 |
|---|---|---|---|---|
| 46 | Simple Random Sampling from Relational Databases | 1986 | VLDB | 0.00071588702 |
| 200 | A Low Communication Sort Algorithm for a Parallel Database Machine | 1989 | VLDB | 0.00035037646 |
Previous
Page 1 / 1
Next