Map
Index
Random
Help
th

Quote: linear hashing is faster and simpler than spiral storage; faster than binary trees and similar to double hashing

topics > all references > references i-l > QuoteRef: larsPA4_1988 , p. abstract



Topic:
adaptive hash table

Quotation Skeleton

Linear hashing is found to be both faster … tree and double hashing with periodic rehashing into … faster than a binary tree, except for very … Overall, linear hashing is a simple and efficient …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: adaptive hash table (19 items)

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