Rev 1147 | Rev 1150 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 1147 | Rev 1148 | ||
|---|---|---|---|
| Line 29... | Line 29... | ||
| 29 | /* |
29 | /* |
| 30 | * This B-tree has the following properties: |
30 | * This B-tree has the following properties: |
| 31 | * - it is a ballanced 2-3-4-5 tree (i.e. BTREE_M = 5) |
31 | * - it is a ballanced 2-3-4-5 tree (i.e. BTREE_M = 5) |
| 32 | * - values (i.e. pointers to values) are stored only in leaves |
32 | * - values (i.e. pointers to values) are stored only in leaves |
| 33 | * - leaves are linked in a list |
33 | * - leaves are linked in a list |
| 34 | * - technically, it is a B+-tree (because of the previous properties) |
34 | * - technically, it is a B+tree (because of the previous properties) |
| 35 | * |
35 | * |
| 36 | * Be carefull when using these trees. They need to allocate |
36 | * Be carefull when using these trees. They need to allocate |
| 37 | * and deallocate memory for their index nodes and as such |
37 | * and deallocate memory for their index nodes and as such |
| 38 | * can sleep. |
38 | * can sleep. |
| 39 | */ |
39 | */ |