Chapter11IndexingandHashing.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * General Extendable Hash Structure In this structure, i2 = i3 = i, whereas i1 = i – 1 (see next slide for details) Use of Extendable Hash Structure Each bucket j stores a value ij All the entries that point to the same bucket have the same values on the first ij bits. To locate the bucket containing search-key Kj: 1. Compute h(Kj) = X 2. Use the first i high order bits of X as a displacement into bucket address table, and follow the pointer to appropriate bucket To insert a record with search-key value Kj follow same procedure as look-up and locate the bucket, say j. If there is room in the bucket j insert record in the bucket. Else the bucket must be split and insertion re-attempted (next slide.) Overflow buckets used instead in some cases (will see shortly) Insertion in Extendable Hash Structure (Cont) If i ij (more than one pointer to bucket j) allocate a new bucket z, and set ij = iz = (ij + 1) Update the second half of the bucket address table entries originally pointing to j, to point to z remove each record in bucket j and reinsert (in j or z) recompute new bucket for Kj and insert record in the bucket (further splitting is required if the bucket is still full) If i = ij (only one pointer to bucket j) If i reaches some limit b, or too many splits have happened in this insertion, create an overflow bucket Else increment i and double the size of the bucket address table. replace each entry in the table by two entries that point to the same bucket. recompute new bucket address table entry for KjNow i ij so use the first case above. To split a bucket j when inserting record with search-key value Kj: Deletion in Extendable Hash Structure To delete a key value, locate it in its bucket and remove it. The bucket itself can be removed if it becomes empty (with appropriate updates to the buck