Answer Posted / nishant
a B+ tree is a type of tree which represents sorted data in
a way that allows for efficient insertion, retrieval and
removal of records, each of which is identified by a key. It
is a dynamic, multilevel index, with maximum and minimum
bounds on the number of keys in each index segment (usually
called a 'block' or 'node'). In a B+ tree, in contrast to a
B-tree, all records are stored at the lowest level of the
tree; only keys are stored in interior blocks.
The primary value of a B+ tree is in storing data for
efficient retrieval in a block-oriented storage context.
Given a storage system with a block size of b, a B+ tree
which stores a number of keys equal to a multiple of b will
be very efficient when compared to a binary search tree (the
corresponding data structure for non-block-oriented storage
contexts).
| Is This Answer Correct ? | 46 Yes | 8 No |
Post New Answer View All Answers
What are the disadvantages of circular list?
Is python good for freshers?
What is the default capacity of hashmap?
Can you override methods of arraylist?
List the limitations of linear probing?
What exactly is data?
Is a hash table a map?
What are the Differences between map and hashmap?
What is the difference between null and void?
Explain binary search tree?
Treemap orders the elements on which field?
What do you mean by collision in hashing?
What are the advantages of modularity?
Which sorting does collections sort use?
Write a program for reversing the Single Linked List?
