Reordering B-tree files
Satoshi W. Watanabe, Takao Miura · 2002
In this investigation, we address a reordering technique that improves sequential processing to B-tree files dramatically. We show conventional reorganization is not fully helpful, and propose reordering of blocks reflecting logical order. First we obtain all the data in a logical order, and then we put them into pre-order. Here we show some experimental results that says how this technique works well.