Live briefing
Everything about External sorting
Class of sorting algorithms that can handle massive amounts of data
External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device and instead they must reside in the slower external memory, usually a disk drive. Thus, external sorting algorithms are external memory algorithms and thus applicable in the external memory model of computation. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: External sortingA 5-minute orientation
- Skim a recent paper: Development of a Mango-Grading and -Sorting System Based on External Features, Using Machine Learning AlgorithmsInfluential work since 2022
- Pick up a classic book: C How to ProgramThe most-reprinted book on the subject
- Read the landmark paper: A comparison between amplitude sorting and phase-angle sorting using external respiratory measurement for 4D CTCited 182 times
- Go sideways: RzipA closely related topic
- Go sideways: Algorithmic efficiencyA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A comparison between amplitude sorting and phase-angle sorting using external respiratory measurement for 4D CT
Automated sorting for size, sex and skeletal anomalies of cultured seabass using external shape analysis
FAST: Flash-aware external sorting for mobile database systems
Induced Sorting Suffixes in External Memory
Evaluation of two synchronized external surrogates for 4D CT sorting
External sorting: Run formation revisited
ActiveSort: Efficient external sorting using active SSDs in the MapReduce framework
In-Line Sorting of Harumanis Mango Based on External Quality Using Visible Imaging
🆕 Influential since 2022
Development of a Mango-Grading and -Sorting System Based on External Features, Using Machine Learning Algorithms
Developing a prediction model in a lightweight packaging waste sorting plant using sensor-based sorting data combined with data of external near-infrared and LiDAR sensors
WiscSort: External Sorting for Byte-Addressable Storage
External Factors Impacting Residents’ Participation in Waste Sorting Using NCA and fsQCA Methods on Pilot Cities in China
Self-Sorting via Macrocyclization by External Templation in Water
📚 Books worth reading
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
Fundamentals of data structures in CEllis Horowitz · 1993
Data structures & algorithms in JavaRobert Lafore · 2003
Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Rzip rzip is a huge-scale data compression computer program designed around initial LZ77-style string matching on a 900 MB dictionary window, followed by bzip2-based…
- Algorithmic efficiency In computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm…
- External memory algorithm In computing, external memory algorithms or out-of-core algorithms are algorithms that are designed to process data that are too large to fit into a computer's…
- ReadyBoost ReadyBoost (codenamed EMD) is a disk caching software component developed by Microsoft for Windows Vista and included in later versions of Windows. ReadyBoost…
- Fractal tree index In computer science, a fractal tree index is a tree data structure that keeps data sorted and allows searches and sequential access in the same time as…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- K-way merge algorithm In computer science, k-way merge algorithms or multiway merges are a specific type of sequence merge algorithms that specialize in taking in k sorted lists…
- Radix sort In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according…