Hi, Nikita Danilov: > Actually, B-link trees (B-trees with sibling pointers) don't require any > additional io for sibling pointers maintenance. Just draw a picture of > what is going on during insertion of new node or node deletion and you > will see. B-link disadvantages are extra space required in a node to > store the sibling pointer and unfriendliness to the "wandered logging". > Would a wandering log really store the updated blocks themselves, or just _log_ them? In the latter case I don't see the difference between a wandering log and the static log we have now; the former case looks like it'd have to write at least three times as much log data (not only the leaf block, but going all the way back to the root) even without taking sibling blocks into account.
-- Matthias Urlichs | noris network AG | http://smurf.noris.de/
