A Degradable Blink-Tree with Periodic Data Reorganization
I.-R. Chen · The Computer Journal · 1995
This paper develops a periodic data reorganization algorithm for the B link -tree data structure in concurrent environments, and identifies conditions under which the data reorganization should be performed in order to minimize the response time per access operation