Dynamic signature hashing

Author

Chung, Yunmo ; Ramakrishna, M.V.

Author_Institution

Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA

fYear

1989

fDate

20-22 Sep 1989

Firstpage

257

Lastpage

262

Abstract

A dynamic hashing scheme that guarantees single access retrieval from the disk is proposed. This is based on the external hashing scheme proposed by G.H. Gonnet and P.A. Larson (see JACM, vol.35, no.1, p.161-84, 1988). The performance of the scheme is achieved at the cost of a small amount of internal memory which remains proportional to the file size. The necessary algorithms for address computation, insertions and file expansions are presented. Since theoretical analysis appears too difficult, the performance is studied using simulations with real-life files

Keywords

information retrieval systems; magnetic disc storage; storage management; address computation; dynamic hashing scheme; dynamic signature hashing; external hashing scheme; file expansions; file size; insertions; internal memory; real-life files; simulations; single access retrieval; theoretical analysis; Analytical models; Computational modeling; Computer science; Costs; Information retrieval; Particle separators; Performance analysis; Probes; Spirals;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International

Conference_Location

Orlando, FL

Print_ISBN

0-8186-1964-3

Type

conf

DOI

10.1109/CMPSAC.1989.65093

Filename

65093

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2070362