G
George Potemkin
Guest
With the compression algorithms in our index b-trees, I'd be very interested to hear who has the deepest index b-tree to see if this should be improved on in the future. I don't think that the number of index levels can be higher than 7. For large tables we will get new level in index tree when the number of records will reach: recs ~(1000-10000)^levels where 1000-10000 is the average number of index keys per leaf block. Max number of records (per SAT2) is 2^64. 2^64=1024^level = max level=6.4 and it's an overestimated value.
Continue reading...
Continue reading...