| 
|
QuoteRef: larsPA4_1988
topics >
all references >
ThesaHelp:
references i-l
ThesaHelp:
ACM references f-l
Topic:
adaptive hash table
Reference
Larson, P.-A., "Dynamic hash tables", Communications of the ACM, 31, 4, April 1988, pp. 446-457. Google
abstract ;;Quote: linear hashing is faster and simpler than spiral storage; faster than binary trees and similar to double hashing
ThesaHelp: references i-l (342 items)
ThesaHelp: ACM references f-l (241 items)
Topic: adaptive hash table (19 items)