Quote: use climbing hashing to increase the storage utilization of linear hashing. It reduces the size of each level

Quotation Skeleton

In this paper, we propose a new dynamic … at a rate of (n+1)/n per full expansion, … two in linear hashing. … From our performance analysis, given a fixed load … by using linear hashing, which is also verified … [p. 80] the file size … on level (i+1) is (s_0+i+1) [where s_0 is the number of initial pages].   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: adaptive hash table (19 items)