b-tree (order m) is a balanced search tree that every node has most m children and a non-leaf node with k children contains k-1 keys in the node (can have branch left edge and right edge and positions between the keys. represents keyA < childKeys < keyB). this is typically used for relational db.
1
B-Tree Tutorial - An Introduction to B-Trees
