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
Describe binary tree and its property.
Run time memory allocation is known as in data structure?
Is a hash table a map?
State the difference between arrays and linked lists?
What is the difference between hashset and treeset?
Can value be null in treemap?
Tell me why might quick sort might be better than merge sort?
What is the need of sorting?
Why is reflection slower?
How do you find the second largest element in an array of integers?
How can we delete any specific node from the linked list?
What are the disadvantages of linked list over array?
Can we give size to arraylist?
What is data structure? Explain.
Can a class have a constructor?
