Interested to Buy Any Domain ? << Click Here >> for more details...
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 is a subtree?
How can we reverse a singly linked list?
Does treemap allow null values?
What is sequential search?
What is the Role of push() and pop() method?
What is the best time complexity of bubble sort?
What is entryset in hashmap?
What is a linear search?
What is a vector element?
Which is the parent class of deque
Which is better arraylist or linkedlist?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
What does map stand for?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Is data structure a data type?
