Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems
Ing-Ray Chen, Salah Hassan · 1995
This paper develops a periodic data reorganization algorithm for the B 'ink-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.