Next:
Properties of B-Trees
Up:
CSE 2320: Algorithms and
Previous:
B-Trees
Properties of B-Trees
1.
Node x
n(x) = #keys stored here
leaf(x) = true if leaf node
key
_{1}
(
x
)
key
_{2}
(
x
)
key
_{3}
(
x
)
key
_{4}
(
x
)
...
key
_{n(x)}
(
x
)
...
c
_{1}
(
x
)
c
_{2}
(
x
)
c
_{3}
(
x
)
c
_{4}
(
x
)
c
_{5}
(
x
)
...
c
_{n(x)+1}
(
x
)
keys
k
_{1}
keys
k
_{2}
keys
k
_{3}
keys
k
_{4}
keys
k
_{5}
...
keys
k
_{n(x)+1}
Copyright © 1998 The University of Texas at Arlington