Quote: triple hashing with LOOKUP2 generating 96 bits of data; as fast as double hashing with 1/13th as many omissions

Quotation Skeleton

we see that [LOOKUP2] propagates a full 96 … we have found that for our purposes, extracting … function three times. … [p. 71] With the 96 bits we get from … indexing [of words vs. bit-in-word], and precise memory utilization. We call … 3SPIN … 3SPIN can utilize about 7 index functions … as fast as SPIN 4.0.7 can utilize two, … more memory and partially because it is using … [number of index functions.]   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash filter (18 items)
Topic: hash table and hash functions (41 items)