Map
Index
Random
Help
th

Quote: linear hashing: no tables; split buckets in a linear order, as needed; use overflow buckets

topics > all references > references i-l > QuoteRef: litwW10_1980 , p. 214



Topic:
adaptive hash table

Quotation Skeleton

Dynamic hashing functions which do not need tables … splits in some predefined order, instead of [splitting] the bucket which undergoes the collision, is the main new … [i.e.. split buckets in a linear order, as needed. Place overflow records into overflow buckets that are removed when that bucket splits.]   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.