Possible Duplicate:
B- trees, B+ trees difference
What are the advantages/disadvantages of BTree+ over BTree? When should I prefer one over other? I'm also interested in knowing any real world examples where one has been preferred over other.
Asked
Active
Viewed 2,740 times
2
Community
- 1
- 1
ashokgelal
- 80,002
- 26
- 71
- 84
-
Looks like a real question to me. – Stephen C Dec 23 '09 at 02:15
-
Is a BTree+ the same thing as a B+tree? Or yet another variation? – Edmund Dec 23 '09 at 04:04
-
Duplicate: [http://stackoverflow.com/questions/870218/b-trees-b-trees-difference](http://stackoverflow.com/questions/870218/b-trees-b-trees-difference) – iokevins Dec 23 '09 at 03:38
1 Answers
2
According to the Wikipedia article about BTree+, this kind of data structure is frequently used for indexing block-oriented storage. Apparently, BTree+ stored keys (and not values) are stored in the intermediate nodes. This would mean that you would need fewer intermediate node blocks and would increase the likelihood of a cache hit.
Real world examples include various file systems; see the linked article.
Stephen C
- 698,415
- 94
- 811
- 1,216