b plus tree

A B+ tree is a dynamic, multilevel index with maximum and minimum bounds on the number of keys in each node. B+ tree is a variety of B tree. But, unlike B tree, all data are saved in the leaves. Internal nodes contain only keys and tree pointers. All leaves are at the same lowest level. Leaf nodes are also linked together as a linked list to make range queries easy. The maximum number of keys in a record is called the order of the B+ tree. The minimum number of keys per record is 1/2 of the maximum number of keys. For example, if the order of a B+ tree is n, each node (except for the root) must have between n/2 and n keys. The number of keys that may be indexed using a B+ tree is a function of the order of the tree and its height. For a n-order B+ tree with a height of h:

maximum number of keys is $n^h$
minimum number of keys is $2(n/2)^{(h-1)}.$

Algorithm

Insertion

step 1. Search the tree, to find out the bucket for the new data.
step 2. If the bucket is not full, insert the record there, otherwise, split the bucket.
step 3.
step 4.

...

Deletion

External links

http://www.seanster.com/BplusTree/BplusTree.html

<< Previous

Word Browser

Next >>

skvoy
buddy ryan
chord on blues
21st lancers
ray rhodes
hamilton spectator trophy
wade phillips
gregg williams
leptodactylidae
pierre bouvier
norv turner

food truck
mykines, faroe islands
israel aharoni
mike martz
lswr n15 class
eric dickerson
john riggins
tnchz
strauder v. west virginia
john stallworth
mike singletary

dutch underground press
asa earl carter
art donovan
bellmark records
bobath concept
revolt of horea, closca and crisan
mistella
grabbed by the ghoulies
bubotuber
fielding positions chart
gonzalo rubalcaba

2005 in the united states
john law
blast ended skrewt
the flowers of romance (song)
alien implants
sahadeva
radomir putnik
joint task force armed forces inaugural committee
vasuki
the family that plays together
self anchored suspension bridge