Database Paper Browser

Back to papers

A Study of Sort Algorithms for Multiprocessor Database Machines

Summary: Parallel external and internal sorting on multiprocessor DB machines; replaces comparison-exchanges with B-way merges and introduces the modified block bitonic sort. Outperforms rivals across wide parameter ranges, aided by memory buffering and techniques like pipelining and parallel internal sorting. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7747
Venue
VLDB
Year
1986
Pagerank
4.7241128e-05
Overall Rank
7,460 | 48.11%
DOI
-

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,562 Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates 1997 VLDB 0.00011356744
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 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
30 Hashing Methods and Relational Algebra Operations 1984 VLDB 0.00078672446
1,434 Query Execution in DIRECT 1979 SIGMOD 0.00012008543
Previous Page 1 / 1 Next

Semantically Similar Papers