Agree, but with indexes is another story :)
B-tree indexes are complicated structures, with roots, nodes, keys, pointers.
Check this link for detailed info:
http://www.istis.unomaha.edu/isqa/haworth/isqa3300/fs010.htm

>Hi,Dorin-
>
>PMFJI, but just a comment-
>
>>After 100000 inserts
>>
>>The index size is 2,994,176 bytes
>>
>>After Reindex is 2,161,152 bytes
>>
>>I think that is because are random generated.
>>From what I've read about B-tree indexes, this can be the cause.
>
>VFP tables are fixed width, so 16 bytes is 16 bytes regardless of how the data is generated.