0
Introduction Of B-Tree – GeeksforGeeks Apr 21, 2013 · B-tree is a fat tree. The height of B-Trees is kept low by putting maximum possible keys in a B-Tree node. Generally, the B-Tree node size is kept equal to the disk block size. Since the height of the B-tree is low so total disk accesses for […]
Continue reading