A Low Communication Sort Algorithm for a Parallel Database Machine
Summary: Low-communication, fully parallel sort for a backend parallel DB machine; covers sort, merge, and return-to-host. Reduces inter-processor data exchange vs prior methods; demonstrated with implementation, measurements, and a scalability model, plus handling of uneven data distribution. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 84 | AlphaSort: A RISC Machine Sort | 1994 | SIGMOD | 0.00053866006 |
| 1,562 | Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates | 1997 | VLDB | 0.00011356744 |
| 2,666 | FastSort: A Distributed Single-Input Single-Output External Sort | 1990 | SIGMOD | 8.3422378e-05 |
| 6,174 | Percentile Finding Algorithm for Multiple Sorted Runs | 1989 | VLDB | 5.1696569e-05 |
| 6,457 | Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships | 1998 | VLDB | 5.0560907e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next