| 
|
Quote: linear hashing with partial expansions and priority splitting; 80% storage utilization, 1 block access per search, and 8% overflow space
topics >
all references >
references m-o >
Topic:
sort algorithms
Topic:
adaptive hash table
Quotation Skeleton
In this section we present a new variation … we call it Linear Hashing with Partial Expansions … it has an improved performance over both of … In particular, now the storage utilization factor equals … are OS=0.08 positions per record on average. … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: sort algorithms (24 items)
Topic: adaptive hash table (19 items)