H-Tree

a specialized tree data structure for directory indexing, similar to a B-tree. They are constant depth of either one or two levels, have a high fanout factor, use a hash of the filename, and do not require balancing… used in the ext3 and ext4 Linux filesystems - Wikipedia / Htree - The Secret Savior of EXT3

Written on January 4, 2025, Last update on
tree hash filesystem search