B-Tree | Set 1 (Introduction) - GeeksforGeeks
The main idea of using B-Trees is to reduce the number of disk accesses. Most of the tree operations (search, insert, delete, max, min, ..etc ) require O(h) disk accesses where h is height of the tree. B-tree is a fat tree. Height of B-Trees is kept low by putting maximum possible keys in a B-Tree node. Generally, a B-Tree node size is kept equal to the disk block size.Read full article from B-Tree | Set 1 (Introduction) - GeeksforGeeks
No comments:
Post a Comment