Multi-way Static Search
If B keys fit per cache line then we use a (B+1)-way branching search tree.
0 1 2 3 4 5 6 7 8 9 10 1112 13 14 15 16 171819 20 21 22 23
1
4
5
8
9
10
14
15
17
20
25
26
27
29
30
31
40
42
48
50
53
55
60
64
1
4
5
8
9
10
14
15
17
20
25
26
27
29
30
31
40
42
48
50
53
55
60
64
Previous slide
Next slide
Back to first slide
View graphic version