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 static array?
What is data structure in programming language?
What is difference between tree and binary tree?
Which sorting algorithm is the slowest?
How to create an Array?
Which is faster arraylist or hashmap?
Which sort algorithm is best?
What is difference between arraylist and linkedlist?
Is hashmap an object?
Define red-black trees.
How do you clear a stack?
Which is faster hashmap or hashset?
how to insert a new node in linked list where free node will be available?
Write the importance of hashing?
What are the non linear data structure?
