Sorting sequential files with limited auxiliary storage

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sorting sequential files with limited auxiliary storage

Full text

Pdf (576 KB)

Source

ACM Southeast Regional Conference archive
Proceedings of the 18th annual Southeast regional conference table of contents

Tallahassee, Florida

SESSION: Government data bases II - GDB II table of contents

Pages: 23 - 31

Year of Publication: 1980

ISBN:0-89791-014-1

Authors

David S. Burris	Sam Houston State University, Huntsville, TX
Kurt Schember	University of Texas Arlington, Arlington, TX

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 0

Additional Information:

abstract references collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/503838.503855 What is a DOI?

ABSTRACT

This paper considers the problem of sorting files whose size exceeds main memory and for which only limited auxiliary memory resources are available.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. M. Barth, "Shifting Garbage Collection Overhead to Compile Time," CAC,. Vol. 19, No. 9, Sept. 1976, pp. 522-526.
	2	Alfs T. Berztiss , A. T. Berztiss, Data Structures: Theory and Practice, Academic Press, Inc., Orlando, FL, 1975
	3	D. S. Burris and K. A. Schember, "Activity- Oriented Lists," Data Base Engineering, Vol. 2, No. 2, June, 1978.
	4	L. Peter Deutsch , Daniel G. Bobrow, An efficient, incremental, automatic garbage collector, Communications of the ACM, v.19 n.9, p.522-526, Sept. 1976 [doi>10.1145/360336.360345]
	5	Robert W. Floyd, Algorithm 245: Treesort, Communications of the ACM, v.7 n.12, p.701, Dec. 1964 [doi>10.1145/355588.365103]
	6	R. Floyd and A. Smith, "A Linear Time Two Tape Merge," Information Processing Letters, Vol. 2, No. 5, Dec., 1973, pp. 123-126.
	7	F. C. Hennie , R. E. Stearns, Two-Tape Simulation of Multitape Turing Machines, Journal of the ACM (JACM), v.13 n.4, p.533-546, Oct. 1966 [doi>10.1145/321356.321362]
	8	W. P. Heising, "Note on Random Addressing Techniques," IBM Sys. J., 2(1963), pp. 112- 116.
	9	Ellis Horowitz , Sartaj Sahni, Fundamentals of Data Structures in Pascal, W. H. Freeman & Co., New York, NY, 1990
	10	D. E. Knuth, Fundamental Algorithms, Addison- Wesley, 1973.
	11	D. E. Knuth, Sorting and Searching, Addison- Wesley, 1975.
	12	H. Lorin, Sorting and Sort Systems, Addison- Wesley, 1975.
	13	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971 [doi>10.1145/356593.356594]
	14	Niklaus Wirth, Algorithms + Data Structures = Programs, Prentice Hall PTR, Upper Saddle River, NJ, 1978
	15	K. A. Schember and J. R. Rumsey, "Minimal Storage Sorting and Searching Techniques for RAM Applications: A Tutorial," Computer, June, 1977, pp. 92-100.
	16	H. Schorr , W. M. Waite, An efficient machine-independent procedure for garbage collection in various list structures, Communications of the ACM, v.10 n.8, p.501-506, Aug. 1967 [doi>10.1145/363534.363554]
	17	J. W. Williams, "Algorithm 232 - Heapsort," CACM 7(1964), pp. 347-348.

Collaborative Colleagues:

David S. Burris: colleagues

Kurt Schember: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player