What is B+ tree?

Answers were Sorted based on User's Feedback



What is B+ tree?..

Answer / wonder

A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.

Is This Answer Correct ?    77 Yes 9 No

What is B+ tree?..

Answer / 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

What is B+ tree?..

Answer / amit patra

In a B+ tree all keys which are in non leaf node will point to
next leaf, So we can traverse sequentially also.

Is This Answer Correct ?    11 Yes 3 No

What is B+ tree?..

Answer / ankita dey

In the B+ tree , all keys are maintained in leaves, and
keys are replicated in non leaf nodes to define path for
locating individual records. The leaves are linked together
to provide a sequential path for traversing the keys in the
tree.

Is This Answer Correct ?    7 Yes 2 No

What is B+ tree?..

Answer / meenakshi sen chouhan

B+ Tree Is a advanced technique of the B tree, this is used
for sorting work or data.

Is This Answer Correct ?    5 Yes 2 No

What is B+ tree?..

Answer / nani

A B+ tree is a data structure in which records associated
with the search keys are at the leaves of the tree.This
provide efficient retrieval,insertion and removal of
records.Keys are triplicale to the non-leaf nodes to
provide a path to the searched record.
NT file system,JFS2 file system and Rationaldata base often
used this data structure for indices.

Is This Answer Correct ?    11 Yes 11 No

Post New Answer

More Data Structures Interview Questions

Can you make an arraylist of arrays?

0 Answers  


Why do we need algorithm?

0 Answers  


What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?

0 Answers  


How is a queue works?

0 Answers  


Is bubble sort faster than selection sort?

0 Answers  






For which header list, the last node contains the null pointer?

0 Answers  


What are the complexity of binary search?

0 Answers  


Define linked list data structure.

0 Answers  


What is mergesort and hashtable?

0 Answers  


What does abstract data type means?

23 Answers   College School Exams Tests, Infosys, SBIT, TCS,


For addition and deletion. Which one is most preferred: array list or linked list?

0 Answers  


Is there any difference between int[] a and int a[]?

0 Answers  


Categories