Database data is internally indexed in a tree structure. The topmost node
points to a number of nodes and these nodes can each point to the same
number of nodes. Bottommost nodes point to the data. When all the
bottommost nodes are full a new level is created at the top.
Forms and SQL were not creating the new levels correctly when required.
The example list stats shows two index levels with 84 entries in each
block. This means that 84 index blocks can be stored in two levels (the top
one block points to 84 index blocks) and 7056 index blocks can be stored in
three levels (84 blocks each point to 84 index blocks). Here there are 85
blocks stored in 2 levels; the index levels should have been increased to
3.
|