what is the different between B-tree and B+ tree.
- 8 Answers
- 41584 Views
- Syntel, I also Faced
- E-Mail Answers
Answer Posted / gajraj singh 8878250971
It's all about branching factor. Because of the way B+-Trees store records (called "satellite information") at the leaf level of the tree, they maximize the branching factor of the internal nodes. High branching factor allows for a tree of lower height. Lower tree height allows for less disk I/O. Less disk I/O theoretically means better performance
In a B- tree you can store both keys and data in the internal/leaf nodes. But in a B+ tree you have to store the data in the leaf nodes only.
A B+ - Tree is in the form of a balanced tree in which every path from the root of the tree to a leaf of the tree is the same length.
Each nonleaf node in the tree has between [n/2] and n children, where n is fixed.
B+ - Trees are good for searches, but cause some overhead issues in wasted space.
| Is This Answer Correct ? | 20 Yes | 4 No |
Post New Answer View All Answers
What is the Difference between sax and dom parser?
Can treemap have null values?
Is binary tree a binary search tree?
What is difference between list and set?
Define balance factor of a node in avl tree?
Why null is not allowed in treemap?
What is data structure what is need of it?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
What is an recursive algorithm?
Program to remove duplicate elements in an array.
What are the disadvantages of using collection classes over arrays?
What stack means?
What are the applications of graph data structure?
How can you implement a stack?
Explain binary representation?
