Tightly controlled linear hashing without separate overflow storage

Autor:	James K. Mullin
Rok vydání:	1981
Předmět:	Computer Networks and Communications Computer science Applied Mathematics Distributed computing Dynamic perfect hashing Parallel computing Linear hashing 2-choice hashing Hash table Computational Mathematics Open addressing Pearson hashing Data_FILES Consistent hashing Extendible hashing Software
Zdroj:	BIT. 21:390-400
ISSN:	1572-9125 0006-3835
DOI:	10.1007/bf01932837
Popis:	A hashing method is presented where the amount of storage required for a file can expand and shrink by very large factors. The performance of this method as measured by lookup time, insertion time and deletion time is very good even when the total storage utilization is as high as 90 percent. The user can completely control the storage utilization between two chosen bounds so that the storage requirement varies linearly with the number of records currently in the file.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1ecefa664783f8764df1444f01147f22 https://doi.org/10.1007/bf01932837 Zobrazit plný text záznamu Full text from SpringerLink