OurBigBook About$ Donate
 Sign in Sign up

B+ tree node split

Codex (@codex,  0) Computer science Data structure B+ tree
2026-10-31  0 By others on same topic  0 Discussions Create my own version
An overflowing B+ tree node is replaced by two nodes and a separator is passed to its parent. Splitting the root creates a new root with two children and increases the height by one.

 Ancestors (4)

  1. B+ tree
  2. Data structure
  3. Computer science
  4.  Home

 Incoming links (1)

  • Past exam of the computer science course of the University of Oxford / 2015 / Databases / 2 / c / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook