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 difference between hashset and linkedhashset?
What is difference between map and hashmap?
Questions related to arrays, such as given a 2 integer array, find the common elements.
Tell me how to find middle element of linked list in one pass?
What is the use of data structure in real life?
What is the idea behind splaying?
What do you mean by back edge?
Which data structure is used to perform recursion?
Does hashtable allow null values?
What is array and string?
What is linked list with example?
Why null is not allowed in treemap?
What are the complexity of binary search?
Define an equivalence relation?
What is scalar data type?
