This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
E.E. Lindstrom, IBM Palo Alto Scientific Center
BucketSort is a new external sorting algorithm for very large files that is a substantial improvement over merge sorting with disks. BucketSort requires an associative secondary storage device, which can be realized by large disk drives with logic-per-track capabilities or by magnetic bubble memory (MBM). This paper describes and analyzes a hypothetical Bucket-Sort implementation that uses bubble memory. A new software marking technique is introduced that reduces the effective time for an associative search.
Index Terms:
vector processing, Analysis of algorithms, associative memory, database systems, external sorting, magnetic bubble memory, probabilistic algorithms, secondary storage
Citation:
E.E. Lindstrom, J.S. Vitter, "The Design and Analysis of BucketSort for Bubble Memory Secondary Storage," IEEE Transactions on Computers, vol. 34, no. 3, pp. 218-233, March 1985, doi:10.1109/TC.1985.1676565
Usage of this product signifies your acceptance of the Terms of Use.