B-Trees

Home > Computer Science > Algorithms and data structures > Trees > B-Trees

A tree data structure that can have more than two children at each node, designed to minimize the number of disk accesses required in large databases.