Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This introduction provides a descriptive typology and normative analysis of the ways boundaries are being questioned in Europe… 
2015
2015
In the era of e-business, firms are changing existing business models and/or create new business models through the discovery of… 
2015
2015
This study sought to investigate the lean supply chain practices and impact on performance of commercial banks in Kenya. This… 
2015
2015
Each individual handles many tasks of finding the most profitable option from a set of options that stochastically provide… 
2010
2010
Survive-minimalism, as developed in Stroik (1999, 2009) and Putnam (2007), argues for a “crash-proof” syntax that is divested of… 
2010
2010
This article argues that, contrary to what is claimed by Chomsky (1995), the operation Merge (= external merge) is not inherently… 
2009
2009
Process bus architecture is a missing element on the road to implementing the next generation of Protection and Control (P&C… 
2008
2008
Every lexical item has an edge feature (EF). EF is the formal representation of the notion of (free) merge. EF distinguishes non… 
Review
1989
Review
1989
We add yet another paper on parallel sorting t o the large body of literature on the topic. We briefly survey a new query… 
1989
1989
Heapsort is an internal sorting method which sorts an array of n records in place in O(n log n) time. Heapsort is generally…