B-trees.ppt

ITSD 4312Advanced Programming II B-trees Motivation for B-trees Need to minimize I/O operations Efficiency of algorithms also determined by performance of hardware Each node can be read in as a block Block size dependant upon hardware Fundamental to database systems Disk Architecture Few Disk Operations Properties of B-trees Full balanced search tree (not binary) Large branching factor (children) Up to 1000 or more Height of an N node B-tree = O(lgtN) Insert, delete, search = O(t lgtN) B-tree Defined Each node consists of Keys = sorted set (defines partitions) Key_Count = number of keys