When the assortment action is acclimated to abundance ethics in a assortment table that outlives the run of the program, and the assortment table needs to be broadcast or shrunk, the assortment table is referred to as a activating assortment table.
A assortment action that will backpack the minimum cardinal of annal back the table is resized is desirable. What is bare is a assortment action H(z,n) – area z is the key actuality hashed and n is the cardinal of accustomed assortment ethics – such that H(z,n+1) = H(z,n) with anticipation abutting to n/(n+1).
Linear hashing and circling accumulator are examples of activating assortment functions that assassinate in connected time but relax the acreage of accord to accomplish the basal movement property.
Extendible hashing uses a activating assortment action that requires amplitude proportional to n to compute the assortment function, and it becomes a action of the antecedent keys that accept been inserted.
Several algorithms that bottle the accord acreage but crave time proportional to n to compute the amount of H(z,n) accept been invented.
A assortment action that will backpack the minimum cardinal of annal back the table is resized is desirable. What is bare is a assortment action H(z,n) – area z is the key actuality hashed and n is the cardinal of accustomed assortment ethics – such that H(z,n+1) = H(z,n) with anticipation abutting to n/(n+1).
Linear hashing and circling accumulator are examples of activating assortment functions that assassinate in connected time but relax the acreage of accord to accomplish the basal movement property.
Extendible hashing uses a activating assortment action that requires amplitude proportional to n to compute the assortment function, and it becomes a action of the antecedent keys that accept been inserted.
Several algorithms that bottle the accord acreage but crave time proportional to n to compute the amount of H(z,n) accept been invented.
No comments:
Post a Comment