HASH TABLES Malathi Mansanpally CS_257 ID-220

Agenda: Extensible Hash Tables Insertion Into Extensible Hash Tables Linear Hash Tables Insertion Into Linear Hash Tables

Extensible Hash Tables Definition: Dynamic Hashing: A hash table that grows to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when item are deleted.

Contd.. Extendable hashing is one form of dynamic hashing. Extendable hashing splits and coalesces buckets as database size changes. A hash table in which the hash function is the last few bits of the key and the table refers to buckets.

i= Buckets Data blocks

Insertion Into Extensible Table Insertion into an extensible hash table begins like insertion into a static hash table. To insert a record with search key K, we compute h(K). Whereas i is the part of the hash data structure.

i=

i=

Linear Hash Tables Linear hashing allows for the expansion of the hash table one slot at a time. The frequent single slot exapnsion can very effectively control the length of the collision chain. In linear hashing, I bits of the hash functions are being used to number array entries and a record with key K is intended for bucket a1a2…….ai and last i bits of h(K).

Contd.. i=1 N=2 R=

Insertion Into Linear Hash Tables We insert a new record, by determining its bucket by the algorithm outlined in above topic. Here we compute h(K), where K is the key of the record. i bits at the end of bit sequence h(K) as the bucket number, m.

Contd.. If m<n, we put the record in m If m>=n, we put the record in bucket m-2^i-1 Here each time we insert, we compare the current number of records r with the threshold ratio of r/n and if the ratio is too high, we add the next bucket to the table.

i=2 n=3 r=

i=2 n=3 r=

i=2 n=4 r=

THANK YOU