What is B+ tree?

Answer Posted / 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       View All Answers


Please Help Members By Posting Answers For Below Questions

Is arraylist a collection?

506


How memory is reserved using a declaration statement in data structure?

604


What is structure of data type?

472


What is the easiest sorting method to use in data structures?

539


How is the front of the queue calculated ?

685






What is meant by binary tree traversal?

542


Write the recursive c function to count the number of nodes present in a binary tree.

462


How would you sort words in a large file?

536


What is arrays copyof?

444


What is storage structure in data structure?

487


Is arraylist a list?

433


Explain the types of linked lists.

530


What are the disadvantages of linear list?

488


Which is faster hashmap or concurrenthashmap?

438


What are different types of sorting algorithms?

457