*snip* > Yes. > B-tree is always balanced: http://www.nist.gov/dads/HTML/btree.html > > Regards, > Sergei *snip*
You are right, B+Trees are always balanced but.... When you insert in increasing order all your inserts will be to the last leaf of the B+tree. This means that you can get some concurrency problems when updating the index since it is always the same part of the index that needs to be locked. I'm not quite sure how MySQL does it locking, but if it locks only the index leafs that it is updating this kind of insertion will give poor performance compared to random insertion. Best regards, Mads -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe: http://lists.mysql.com/[EMAIL PROTECTED]
