Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,869,408 papers from all fields of science
Search
Sign In
Create Free Account
Internal sort
Known as:
Internal sorting
An internal sort is any data sorting process that takes place entirely within the main memory of a computer. This is possible whenever the data to be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
External sorting
Merge sort
Selection sort
The Art of Computer Programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Fast sort of floating-point data for data engineering
Changsoo Kim
,
Sungroh Yoon
,
Dongseung Kim
Advances in Engineering Software
2011
Corpus ID: 205294942
1993
1993
Analysis of Pipelined External Sorting on a Reconfigurable Message-Passing Multicomputer
B. Menezes
,
I. Ricarte
,
R. Thurimella
Parallel Computing
1993
Corpus ID: 37536875
1989
1989
Percentile Finding Algorithm for Multiple Sorted Runs
B. Iyer
,
Gary R. Ricard
,
P. Varman
Very Large Data Bases Conference
1989
Corpus ID: 2991313
External sorting is frequently used b>relational database s!-stems for building indexes on tables, ordered retrieval, duplicate…
Expand
1988
1988
V4ITD: A portable and efficient FORTRAN implementation of the 4IT algorithm using virtual memory and an external storage device
C. F. Bunge
,
A. Bunge
,
G. Cisneros
,
J. Daudey
Computers and Chemistry
1988
Corpus ID: 33335452
1986
1986
A Study of Sort Algorithms for Multiprocessor Database Machines
J. Menon
Very Large Data Bases Conference
1986
Corpus ID: 16745275
This paper presents and analyzes algorithms for parallel execution of sort operations in a general multiprocessor architecture…
Expand
1982
1982
Sorting Numbers in Linear Expected Time and Optimal Extra Space
T. Gonzalez
,
Donald B. Johnson
Information Processing Letters
1982
Corpus ID: 37977295
1969
1969
Internal Sorting with Minimal Comparing
L. Woodrum
IBM Systems Journal
1969
Corpus ID: 45979869
An ordering operator that leads to the development of an algorithm for internal sorting is described. An analysis of the…
Expand
1966
1966
Internal Sorting by Radix Plus Sifting
Donald
,
I~v Aclaren
JACM
1966
Corpus ID: 16647848
A method is proposed for internal sorting which has the property that the expected time required per record, to sort n records…
Expand
1964
1964
Internal sorting
Hans-J. Pohlmann
CACM
1964
Corpus ID: 6827717
derives from the fact that Y¢ = x¢+~ corresponds to a gain of e ~'~. The general expression for the power transfer function P (oo…
Expand
1959
1959
Radix Exchange—An Internal Sorting Method for Digital Computers
P. Hildebrandt
,
H. Isbitz
JACM
1959
Corpus ID: 15907245
This note describes a new technique—Radix Exchange—for sorting data internal to the high speed memory of an electronic binary…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE