tag

#b-tree

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 4. Tree and Indexed Search ›

B Tree Search

B Tree Search B tree search generalizes binary search tree search from two children per node to many children per node. Each node stores several sorted keys and several child pointers. This structure reduces tree height. That makes B trees useful for databases, filesystems, and storage engines where reading one large node from disk or cache is cheaper than following many small pointers. Problem Given a B tree root root...

Wiki › Algorithms › 01. Searching and Sorting › 10. External Memory, Cache, and Database Sorting ›

B Tree Bulk Load Sort

B Tree Bulk Load Sort B tree bulk load sort constructs a B-tree from a dataset by first sorting the data and then building the tree in a single pass. The sorting phase produces ordered records, and the bulk loading phase organizes them into tree nodes efficiently. This method avoids inserting records one by one into a B-tree, which would cause many random I/O operations. Problem Given a large dataset,...