Studied by 0 people
B Trees
________ can be easily optimized to adjust its size (that is the number of child nodes) according to the disk size.
Multi level index
________ can be designed by using B Tree for keeping the data sorted in a self- balancing fashion.Search Operation.
search operation
The ________ is the simplest operation on B Tree.
delete operation
The ________ has more rules than insert and search operations.
Note
Flashcard