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
Is boolean a data type?
What do you mean by data types?
What is the difference between one and two dimensional?
What is difference between tree and binary tree?
Does arraylist maintain insertion order?
Which data structures are applied when dealing with a recursive function?
What are the issues that hamper the efficiency in sorting a file?
Can arraylist have null values?
Is char array null terminated?
What is the use of prototype?
What is difference between arraylist and list?
State the difference between persistent and ephemeral data structure?
How many types of data structure are there?
What is the need for extendible hashing?
Is it possible to store null key and null values in a hashmap?
