Everything About ___
Live briefing

Everything about HTree

Tree data structure for directory indexing

An HTree is 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. The HTree algorithm is distinguished from standard B-tree methods by its treatment of hash collisions, which may overflow across multiple leaf and index blocks. HTree indexes are used in the ext3 and ext4 Linux filesystems, and were incorporated into the Linux kernel around 2.5.40. HTree indexing improved the scalability of Linux ext2 based filesystems from a practical limit of a few thousand files, into the range of tens of millions of files per directory. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: HTreeA 5-minute orientation
  2. Pick up a classic book: Accounting Principles with CD 6e Volume 1 and Peac Htree Complete Accounting SetThe most-reprinted book on the subject
  3. Read the landmark paper: HTree: Hardware Trojan Attack on Cache Resizing PoliciesCited 0 times
  4. Go sideways: Ext4A closely related topic
  5. Go sideways: Ext2A closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. History
  2. Use
  3. PHTree

🏆 Landmark papers (most cited)

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics