Analysis of a file addressing method

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analysis of a file addressing method

Full text

Pdf (381 KB)

Source

Communications of the ACM archive
Volume 5 , Issue 8 (August 1962) table of contents

Pages: 459 - 462

Year of Publication: 1962

ISSN:0001-0782

Authors

G. Schay, Jr.	IBM Corporation, Yorktown Heights, NY
W. G. Spruth	IBM Corporation, Yorktown Heights, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 13, Citation Count: 12

Additional Information:

abstract references cited by 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/368637.368827 What is a DOI?

ABSTRACT

This paper presents a new file addressing method based on the calculation of an address from the identification of a record. For large recirculating type files, it seems to be more advantageous than customary ones. The probability distribution of the displacement of records from their calculated address, which is one less than the number of probes required to address a record, is computed on the basis of a Markov chain model. For the reader not interested in the mathematics, the introduction and the summary should be sufficient.

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	ETERSON, W. W. Addressing for random-access storage. IBM J . R e s . Dev. I (1957) 130-146.
	2	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]
	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]

CITED BY 13

	J. Ian Munro , Pedro Celis, Techniques for collision resolution in hash tables with open addressing, Proceedings of 1986 ACM Fall joint computer conference, p.601-610, November 1986, Dallas, Texas, United States
	Robert Morris, Scatter storage techniques, Communications of the ACM, v.26 n.1, p.39-42, Jan. 1983
	Robert Morris, Scatter storage techniques, Communications of the ACM, v.11 n.1, p.38-44, Jan. 1968
	W. D. Maurer , T. G. Lewis, Hash Table Methods, ACM Computing Surveys (CSUR), v.7 n.1, p.5-19, March 1975
	Dennis G. Severance, Identifier Search Mechanisms: A Survey and Generalized Model, ACM Computing Surveys (CSUR), v.6 n.3, p.175-194, Sept. 1974
	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
	M. Tainiter, Addressing for Random-Access Storage with Multiple Bucket Capacities, Journal of the ACM (JACM), v.10 n.3, p.307-315, July 1963
	Dennis Severance , Ricardo Duhne, A practitioner's guide to addressing algorithms, Communications of the ACM, v.19 n.6, p.314-326, June 1976
	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
	Georg Ch. Pflug , Hans W. Kessler, Linear probing with a nonuniform address distribution, Journal of the ACM (JACM), v.34 n.2, p.397-410, April 1987
	M. D. Mc Ilroy, A variant method of file searching, Communications of the ACM, v.6 n.3, p.101, March 1963
	Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990

Collaborative Colleagues:

G. Schay, Jr.: colleagues

W. G. Spruth: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player