Interested to Buy Any Domain ? << Click Here >> for more details...
what is the different between B-tree and B+ tree.
- 8 Answers
- 44247 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 vector and types of vector?
Mention the data structures which are used in graph implementation.
Is arraylist reference type?
What is a string or array type?
Why might quick sort might be better than merge sort?
Which interfaces are implemented by linkedhashset?
What is minimum depth of binary tree?
What is data type with example?
What happens when arraylist is full?
What is the difference between push and pop?
Why are b trees used?
Which is best book for data structures?
How do you sort in ascending order in arraylist?
What is sort function?
What is arrays copyof?
