B-tree

Abbreviation for "balanced tree."

A compact structure that allows the NSS system to retrieve an object from disk in no more than four I/O cycles. B-trees also allow the system to locate an object anywhere in storage without loading the entire directory entry table (DET) into memory.