Btræstruktur
Btræstruktur, commonly known as the B-tree, is a self-balancing multiway search tree designed to store sorted data and support efficient lookup, insertion, and deletion. It is optimized for storage systems where data is read and written in blocks, such as databases and filesystems.
Structure: A B-tree of minimum degree t has the following constraints: every node contains between t-1 and
Operations: Search proceeds from the root to a leaf by comparing the target key with the keys
Variants and usage: A related variant is the B+ tree, in which all data records reside in
History: The B-tree was introduced in 1972 by Rudolf Bayer and Edward McCreight. It remains a foundational