Talk:B+ tree
From Wikipedia, the free encyclopedia
This article was the subject of a Wiki Education Foundation-supported course assignment, between 19 January 2022 and 4 May 2022. Further details are available on the course page. Student editor(s): 00Nexiom (article contribs). Peer reviewers: Bulaaf.
More information Things you can help WikiProject Computer science with: ...
This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
Close
inner insert breay, this diagram erringly splits nodes right when they reach capacity, thus precluding there ever being any "full" nodes. B-tree algorithms (and B+-tree) are supposed to split nodes only after capacity is reached and a new value is tried to be inserted in a full node. 132.198.12.98 21:30, 30 November 2007 (UTC)
- The diagram is incorrect and has been removed. While there are some implementations of B+ trees that do split before the block is full (this allows you to perform the split after insertion is completed), this is not the "normal" procedure.78.91.39.182 15:13, 1 December 2007 (UTC)