LINEAR HASHING: A NEW TOOL FOR FILE AND TABLE ADDRESSING.

被引：0

作者：

Litwin, Witold

机构：

来源：

Very Large Data Bases, International Conference on Very Large Data Bases | 1980年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Linear hashing is a hashing in which the address space may grow or shrink dynamically. A file or a table may then support any number of insertions or deletions without access or memory load performance deterioration. A record in the file is, in general, found in one access, while the load may stay practically constant up to 90%. A record in a table is found in a mean of 1. 7 accesses, while the load is constantly 80%. No other algorithms attaining such a performance are known.

引用

页码：212 / 223