Issue No. 03 - May/June (2003 vol. 15)
Kazuhiko Kato , IEEE Computer Society
<p><b>Abstract</b>—This paper presents an approach to enhancing B-tree indexing performance by using a replication technique called <it>persistent caching</it>. A notable feature of the approach is its compatibility with ordinary B-Trees; it exploits only the otherwise unused area of each B-Tree page, and the basic behavior of B-Trees need not be changed. This paper evaluates the performance of persistently cached B-trees by showing the result of mathematical analysis and of experimental investigations.</p>
B-trees, B^+-trees, database management system, secondary storage management, replication, persistent caching, complex objects, indexing structure.
K. Kato, "Persistently Cached B-Trees," in IEEE Transactions on Knowledge & Data Engineering, vol. 15, no. , pp. 706-720, 2003.