External sorting

Known as: External sort, External merge, On disk merge 
External sorting is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper we describe the design and implementation of CellSort − a high performance distributed sort algorithm for the Cell… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a novel external sorting algorithm using graphics processors (GPUs) on large databases composed of billions of records… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
External sorting of large files of records involves use of disk space to store temporary files, processing time for sorting, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited… (More)
  • figure 1
Is this relevant?
2000
2000
This paper presents an optimal external sorting algorithm for two-level memory model. Our method is different from the… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
1993
1993
In real-time and goal-oriented database systems, the amount of memory assigned to queries that sort or join large relations may… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We present an elegant deterministic load balancing strategy for distribution sort that is applicable to a wide variety of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We provide tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs (I/OS) between internal… (More)
  • figure 1
  • figure 2
Is this relevant?
1984
1984
The problem of sorting n elements using VLSI chips that can sort only q(q < n) elements at a time is considered. The proposed… (More)
  • figure 2
Is this relevant?