Map
Index
Random
Help
th

Quote: FKS perfect hashing is an efficient variation of Fredman et. al's algorithm; within 2x of linear probing

QuoteRef: silvC_2002 , p. 45



Topic:
perfect hash table

Quotation Skeleton

The perfect hashing algorithm as described in [Fredman, Komlos, Szemeredi, J ACM 31.3:538-544, 1984] may not be practical due to the cost of multiplying … also parsimonious in terms of its space requirements. … Experimental results on the DIMACS data set indicate … [hashing with linear probing] in terms of both time and space utilization.   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: perfect hash table (9 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.