Extendible hashing

Extendible hashing is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. ^[1] Because of the hierarchical nature of the system, re-hashing is an incremental operation (done one bucket at a time, as needed). This means that time-sensitive applications are less affected by table growth than by standard full-table rehashes.

Extendible hashing was described by Ronald Fagin in 1979. Practically all modern filesystems use either extendible hashing or B-trees. In particular, the Global File System, ZFS, and the SpadFS filesystem use extendible hashing. ^[2]

Example

Assume that the hash function ${\displaystyle h(k)}$ returns a string of bits. The first ${\displaystyle i}$ bits of each string will be used as indices to figure out where they will go in the "directory" (hash table), where ${\displaystyle i}$ is the smallest number such that the index of every item in the table is unique.

Keys to be used:

${\displaystyle {\begin{aligned}h(k_{1})=100100\\h(k_{2})=010110\\h(k_{3})=110110\end{aligned}}}$

Let's assume that for this particular example, the bucket size is 1. The first two keys to be inserted, k₁ and k₂, can be distinguished by the most significant bit, and would be inserted into the table as follows:

Now, if k₃ were to be hashed to the table, it wouldn't be enough to distinguish all three keys by one bit (because both k₃ and k₁ have 1 as their leftmost bit). Also, because the bucket size is one, the table would overflow. Because comparing the first two most significant bits would give each key a unique location, the directory size is doubled as follows:

And so now k₁ and k₃ have a unique location, being distinguished by the first two leftmost bits. Because k₂ is in the top half of the table, both 00 and 01 point to it because there is no other key to compare to that begins with a 0.

The above example is from Fagin et al. (1979).

Further detail

${\displaystyle h(k_{4})=011110}$

Now, k₄ needs to be inserted, and it has the first two bits as 01..(1110), and using a 2 bit depth in the directory, this maps from 01 to Bucket A. Bucket A is full (max size 1), so it must be split; because there is more than one pointer to Bucket A, there is no need to increase the directory size.

What is needed is information about:

1. The key size that maps the directory (the global depth), and
2. The key size that has previously mapped the bucket (the local depth)

In order to distinguish the two action cases:

1. Doubling the directory when a bucket becomes full
2. Creating a new bucket, and re-distributing the entries between the old and the new bucket

Examining the initial case of an extendible hash structure, if each directory entry points to one bucket, then the local depth should be equal to the global depth.

The number of directory entries is equal to 2^{global depth}, and the initial number of buckets is equal to 2^{local depth}.

Thus if global depth = local depth = 0, then 2⁰ = 1, so an initial directory of one pointer to one bucket.

Back to the two action cases; if the bucket is full:

1. If the local depth is equal to the global depth, then there is only one pointer to the bucket, and there is no other directory pointers that can map to the bucket, so the directory must be doubled.
2. If the local depth is less than the global depth, then there exists more than one pointer from the directory to the bucket, and the bucket can be split.

Key 01 points to Bucket A, and Bucket A's local depth of 1 is less than the directory's global depth of 2, which means keys hashed to Bucket A have only used a 1 bit prefix (i.e. 0), and the bucket needs to have its contents split using keys 1 + 1 = 2 bits in length; in general, for any local depth d where d is less than D, the global depth, then d must be incremented after a bucket split, and the new d used as the number of bits of each entry's key to redistribute the entries of the former bucket into the new buckets.

Now,

${\displaystyle h(k_{4})=011110}$

is tried again, with 2 bits 01.., and now key 01 points to a new bucket but there is still ${\displaystyle k_{2}}$ in it (${\displaystyle h(k_{2})=010110}$ and also begins with 01).

If ${\displaystyle k_{2}}$ had been 000110, with key 00, there would have been no problem, because ${\displaystyle k_{2}}$ would have remained in the new bucket A' and bucket D would have been empty.

(This would have been the most likely case by far when buckets are of greater size than 1 and the newly split buckets would be exceedingly unlikely to overflow, unless all the entries were all rehashed to one bucket again. But just to emphasize the role of the depth information, the example will be pursued logically to the end.)

So Bucket D needs to be split, but a check of its local depth, which is 2, is the same as the global depth, which is 2, so the directory must be split again, in order to hold keys of sufficient detail, e.g. 3 bits.

1. Bucket D needs to split due to being full.
2. As D's local depth = the global depth, the directory must double to increase bit detail of keys.
3. Global depth has incremented after directory split to 3.
4. The new entry ${\displaystyle k_{4}}$ is rekeyed with global depth 3 bits and ends up in D which has local depth 2, which can now be incremented to 3 and D can be split to D' and E.
5. The contents of the split bucket D, ${\displaystyle k_{2}}$, has been re-keyed with 3 bits, and it ends up in D'.
6. K4 is retried and it ends up in E which has a spare slot.

Now, ${\displaystyle h(k_{2})=010110}$ is in D and ${\displaystyle h(k_{4})=011110}$ is tried again, with 3 bits 011.., and it points to bucket D which already contains ${\displaystyle k_{2}}$ so is full; D's local depth is 2 but now the global depth is 3 after the directory doubling, so now D can be split into bucket's D' and E, the contents of D, ${\displaystyle k_{2}}$ has its ${\displaystyle h(k_{2})}$ retried with a new global depth bitmask of 3 and ${\displaystyle k_{2}}$ ends up in D', then the new entry ${\displaystyle k_{4}}$ is retried with ${\displaystyle h(k_{4})}$ bitmasked using the new global depth bit count of 3 and this gives 011 which now points to a new bucket E which is empty. So ${\displaystyle k_{4}}$ goes in Bucket E.

Example implementation

Below is the extendible hashing algorithm in Python, with the disc block / memory page association, caching and consistency issues removed. Note a problem exists if the depth exceeds the bit size of an integer, because then doubling of the directory or splitting of a bucket won't allow entries to be rehashed to different buckets.

The code uses the least significant bits , which makes it more efficient to expand the table, as the entire directory can be copied as one block (Ramakrishnan & Gehrke (2003)).

Python example

PAGE_SZ=10classPage:def__init__(self)->None:self.map=[]self.local_depth=0deffull(self)->bool:returnlen(self.map)>=PAGE_SZdefput(self,k,v)->None:fori,(key,value)inenumerate(self.map):ifkey==k:delself.map[i]breakself.map.append((k,v))defget(self,k):forkey,valueinself.map:ifkey==k:returnvaluedefget_local_high_bit(self):return1<<self.local_depthclassExtendibleHashing:def__init__(self)->None:self.global_depth=0self.directory=[Page()]defget_page(self,k):h=hash(k)returnself.directory[h&((1<<self.global_depth)-1)]defput(self,k,v)->None:p=self.get_page(k)full=p.full()p.put(k,v)iffull:ifp.local_depth==self.global_depth:self.directory*=2self.global_depth+=1p0=Page()p1=Page()p0.local_depth=p1.local_depth=p.local_depth+1high_bit=p.get_local_high_bit()fork2,v2inp.map:h=hash(k2)new_p=p1ifh&high_bitelsep0new_p.put(k2,v2)foriinrange(hash(k)&(high_bit-1),len(self.directory),high_bit):self.directory[i]=p1ifi&high_bitelsep0defget(self,k):returnself.get_page(k).get(k)if__name__=="__main__":eh=ExtendibleHashing()N=10088l=list(range(N))importrandomrandom.shuffle(l)forxinl:eh.put(x,x)print(l)foriinrange(N):print(eh.get(i))

Notes

1. Fagin et al. (1979).
2. Mikuláš Patocka (2006). Design and Implementation of the Spad Filesystem (PDF) (Thesis). Archived from the original (PDF) on 2016-03-15. Retrieved 2016-02-27. "Section 4.1.6 Extendible hashing: ZFS and GFS" and "Table 4.1: Directory organization in filesystems"

See also

• Trie
• Hash table
• Stable hashing
• Consistent hashing
• Linear hashing

References

• Fagin, R.; Nievergelt, J.; Pippenger, N.; Strong, H. R. (September 1979), "Extendible Hashing - A Fast Access Method for Dynamic Files", ACM Transactions on Database Systems, 4 (3): 315–344, doi:10.1145/320083.320092, S2CID   2723596
• Ramakrishnan, R.; Gehrke, J. (2003), Database Management Systems, 3rd Edition: Chapter 11, Hash-Based Indexing, pp. 373–378
• Silberschatz, Abraham; Korth, Henry; Sudarshan, S., Database System Concepts, Sixth Edition: Chapter 11.7, Dynamic Hashing

External links

•  This article incorporates public domain material from Paul E. Black. "Extendible hashing". Dictionary of Algorithms and Data Structures . NIST.
• Extendible Hashing notes at Arkansas State University
• Extendible hashing notes Archived 2016-03-03 at the Wayback Machine
• Slides from the database System Concepts book on extendible hashing for hash based dynamic indices