Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest and Clifford Stein : Chapter 18

The authors discuss about B-Trees in this chapter. The authors first introduce the architecture of a disk-drive. The authors then define B-Tree and prove the relationship between the number of keys and the height of the tree.

The authors then define operations like SEARCH, INSERT, DELETE and CREATE for B-Tree. The authors prove that DELETE, INSERT and SEARCH takes $O(h)$ disk accesses and $ O(t \times h) $ time while CREATE takes $O(1)$ disk accesses and $O(1)$ time.