Scribd
Upload
5 views2 pages

Session05 FileProcessing

The document discusses Extendible Hashing, a method for file processing that uses a directory of pointers to buckets to avoid overflowing pages by splitting full buckets. It introduces concepts of global depth and local depth, with an example illustrating how data entries are inserted. Additionally, it mentions the merging of empty buckets with their 'split image' upon deletion of data entries.

Uploaded by

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

Session05 FileProcessing

The document discusses Extendible Hashing, a method for file processing that uses a directory of pointers to buckets to avoid overflowing pages by splitting full buckets. It introduces concepts of global depth and local depth, with an example illustrating how data entries are inserted. Additionally, it mentions the merging of empty buckets with their 'split image' upon deletion of data entries.

Uploaded by

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

‫علوم الحاسب‬

‫الفرقة الثانية‬

‫معالجة الملفات‬
File Processing

Computer Science Department


Extendible Hashing
 Use directory of pointers to buckets.
 Extendible Hashing avoids overflowing pages by splitting a full bucket
when a new data entry is to be added to it.

 There are global depth and local depth.


 Example: Directory is array of size 4, so 2 bits needed.
 Insert: H(r) → 21, 19, 15

 Insert: H(r) → 20

 Delete: If removal of data entry makes bucket empty, can be merged


with `split image’.

1|Page

You might also like