Addressing for Random-Access Storage with Multiple Bucket Capacities

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Addressing for Random-Access Storage with Multiple Bucket Capacities

Full text

Pdf (400 KB)

Source

Journal of the ACM (JACM) archive
Volume 10 , Issue 3 (July 1963) table of contents

Pages: 307 - 315

Year of Publication: 1963

ISSN:0004-5411

Author

M. Tainiter

International Business Machines Corporation, Thomas J. Watson Research Center, Yorktown Heights, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 24, Citation Count: 3

Additional Information:

references cited by index terms

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/321172.321178 What is a DOI?

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	PETERSON, W.W. Addressing for random-access storage. IBM J. Des. Develop. 1 (1957), 130-146.
	2	G. Schay, Jr. , W. G. Spruth, Analysis of a file addressing method, Communications of the ACM, v.5 n.8, p.459-462, Aug. 1962 [doi>10.1145/368637.368827]
	3	Ivan Flores, Computer Time for Address Calculation Sorting, Journal of the ACM (JACM), v.7 n.4, p.389-409, Oct. 1960 [doi>10.1145/321043.321051]
	4	TITCHMARSH, E .C . Theory of Functions. Oxford Press, 1939.
	5	WHITTAKER, E. T.; WATSON~ G.N. Modern Analysis. Cambridge Press, 1952.
	6	L. R. Johnson, An indirect chaining method for addressing on secondary keys, Communications of the ACM, v.4 n.5, p.218-222, May 1961 [doi>10.1145/366532.366540]
	7	TAKACS, L. Theory of Queues. Oxford Press, 1962.

CITED BY 3

	V. Y. Lum , P. S. T. Yuen , M. Dodd, Key-to-address transform techniques: a fundamental performance study on large existing formatted files, Communications of the ACM, v.14 n.4, p.228-239, April 1971
	W. D. Maurer , T. G. Lewis, Hash Table Methods, ACM Computing Surveys (CSUR), v.7 n.1, p.5-19, March 1975
	C. C. Chang, The study of an ordered minimal perfect hashing scheme, Communications of the ACM, v.27 n.4, p.384-387, April 1984

INDEX TERMS

Primary Classification:
G. Mathematics of Computing

Additional Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2 Nonnumerical Algorithms and Problems
Subjects: Sorting and searching

General Terms:
Measurement, Performance, Theory

Adobe Acrobat

QuickTime

Windows Media Player

Real Player