Scribd
Upload
490 views7 pages

Introduction To Extendible: Hashing

Extendible hashing is a dynamic hashing method that uses directories and buckets to hash data. It uses a flexible hash function that can dynamically change. Directories store pointers to buckets, which store hashed keys. Global depth denotes the number of bits used by the hash function, while local depth is associated with buckets. When a bucket overflows, the directory doubles in size and the bucket's elements are rehashed with a new global depth.

Uploaded by

Ayush Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
490 views7 pages

Introduction To Extendible: Hashing

Extendible hashing is a dynamic hashing method that uses directories and buckets to hash data. It uses a flexible hash function that can dynamically change. Directories store pointers to buckets, which store hashed keys. Global depth denotes the number of bits used by the hash function, while local depth is associated with buckets. When a bucket overflows, the directory doubles in size and the bucket's elements are rehashed with a new global depth.

Uploaded by

Ayush Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

INTRODUCTION TO EXTENDIBLE

HASHING

Extendible Hashing is a dynamic hashing


method wherein directories, and buckets are used
to hash data.

It is an aggressively flexible method in which the


hash function also experiences dynamic changes. 

Main features of Extendible Hashing: The main features


in this hashing technique are: 

DIRECTORIES
BUCKETS
BASIC STRUCTURE OF EXTENDIBLE
HASHING

 Directories: These containers
store pointers to buckets.Every
directory has its unique id .
 Buckets: They store the hashed
keys. Directories point to buckets. 
 Global Depth: It is associated with
the Directories. They denote the
number of bits which are used by
the hash function to categorize the
keys.
 Local Depth: It is the same as that
of Global Depth except for the fact
that Local Depth is associated with
the buckets and not the directories.
WORKING OF EXTENDIBLE
HASHING

 Step 1 – Analyze Data Elements.


 Step 2 – Convert into binary
format.
 Step 3 – Check Global Depth of
the directory.
 Step 4 – Identify the Directory
 Step 5 – Navigation.
 Step 6 – Insertion and Overflow
Check.

Step 7 – Tackling Over Flow
Condition during Data
Insertion.
 Step 8 – Rehashing of Split
Bucket Elements.
OVERLAPPING CONCEPT

 It usually happens when the


local depth of the bucket =
global depth.

 Here local depth of bucket is


3.

 20 is inserted in bucket
pointed out by
00. (directory)

 Now ,here we’ll study the


new concept i.e
BUCKET SPLITING
BUCKET SPLITING

  Since the local depth of


the bucket = global-depth.
 Directory expansion
(doubling) takes place along
with bucket splitting.
 Elements present in
overflowing bucket are
rehashed with the new
global depth.

 The key observation here:


 Bucket can have more than
one pointers pointing to its
local depth.
LIMITATIONS OF EXTENDIBLE
HASHING

 Size of every bucket is fixed.

 Memory is wasted in pointers when the global depth and


local depth difference becomes drastic.

 This method is complicated to code.


CONCLUSION TO EXTENDIBLE
HASHING

 Data retrieval is less expensive (in terms of


computing).

 No problem of Data-loss since the storage capacity


increases dynamically.

 With dynamic changes in hashing function,


associated old values are rehashed w.r.t the new
hash function.

You might also like