'3 disc reads assuming' presentation slideshows

Trees-II

659 views • 52 slides

B-Trees

B-Trees. Definition of a B-tree. A B-tree of order m is an m -way tree (i.e., a tree where each node may have up to m children) in which:

386 views • 30 slides

B-tree

B-tree. Why B-Trees. When the data is too big, we will have to use disk storage instead of putting all the data in main memory In such case, we have to take into account the fact that disk access takes much longer time than many other instructions. Disk Access Time.

332 views • 15 slides