This Article 
 Bibliographic References 
 Add to: 
Persistently Cached B-Trees
May/June 2003 (vol. 15 no. 3)
pp. 706-720
Kazuhiko Kato, IEEE Computer Society

Abstract—This paper presents an approach to enhancing B-tree indexing performance by using a replication technique called persistent caching. 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.

[1] R.A. Baeza-Yates, "Expected Behaviour of B+-Trees Under Random Insertions," Acta Information, vol. 26, pp. 439-471, 1989.
[2] R.A. Baeza-Yates, “Fringe Analysis Revisited,” ACM Computing Surveys, vol. 27, no. 1, pp. 109-119, 1995.
[3] R.A. Baeza-Yates and P. Larson, "Performance of B+-Trees with Partial Expansions," IEEE Trans. Knowledge Data Eng., vol. 1, no. 2, pp. 248-257, June 1989.
[4] R.A. Baeza-Yates and P.V. Poblete, “Higher-Order Analysis of 2-3 Trees,” Int'l J. Fundations of Computer Science, vol. 6, no. 1, pp. 1-10, 1995.
[5] R. Bayer and E. McCreight, “Organization and Maintenance of Large Ordered Indexes,” Acta Informatica, vol. 1, no. 3, pp. 173-189, 1972.
[6] M. Brown, “Some Observations on Random 2-3 Trees,” Information Processing Letters, vol. 9, no. 2, pp. 57-59, 1979.
[7] D. Comer, “The Ubiquitous B-Tree,” ACM Computing Surveys, vol. 11, no. 2, pp. 121-137, June 1979.
[8] B. Eisenbarth, G.H. Gonnet, and D. Wood, “The Theory of Fringe Analysis and Its Appliation to 2-3 Trees and B-Trees,” Information and Control, vol. 55, pp. 125-174, 1982.
[9] G. Frederickson, “Improving Storage Utilization in Balanced Trees,” Proc. 17th Allerton Conf. Comm., Contr. Comput., pp. 255-264, 1979.
[10] K. Kato and T. Masuda, “Persistent Caching: An Implementation Technique for Complex Objects with Object Identity,” IEEE Trans. Software Eng., vol. 18, no. 7, pp. 631-645, July 1992.
[11] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[12] D.B. Lomet, “Partial Expansions for File Organizations with an Index,” ACM Trans. Database Systems, vol. 12, no. 1, pp. 65-84, Mar. 1987.
[13] L.F. Mackert and G.M. Lohman, “Index Scans Using a Finite LRU Buffer: A Validated I/O Model,” ACM Trans. Database Systems, vol. 14, no. 3, pp. 401-424, 1989.
[14] R.E. Miller, N. Pippenger, A.L. Rosenberg, and L. Snyder, “Optimal 2,3-Trees,” SIAM J. Computing, vol. 8, no. 1, pp. 42-59, Feb. 1979.
[15] A.L. Rosenberg and L. Snyder, "Time and Space Optimality in B-Trees," ACM Trans. Database Systems, vol. 6, no. 1, Mar. 1981.
[16] E.J. Shekita and M.J. Carey, “Performance Enhancement Through Replication in an Object-Oriented DBMS,” Proc. ACM SIGMOD Conf. Management of Data, pp. 325-336, June 1989.
[17] A. Shimizu and K. Kato, “Applying the Persistent Caching Technique to Extendible Hashing,” IEICE Trans. J82-D-I, no. 1, pp. 24-33, Jan. 1999.
[18] A. Silberschatz, H.F. Kort, and S. Sudarshan, Database System Concepts. McGraw-Hill, third ed., 1999.
[19] A.C. Yao, “On Random 2-3 Trees,” Acta Informatica, vol. 9, pp. 159-170, 1978.

Index Terms:
B-trees, B^+-trees, database management system, secondary storage management, replication, persistent caching, complex objects, indexing structure.
Kazuhiko Kato, "Persistently Cached B-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 3, pp. 706-720, May-June 2003, doi:10.1109/TKDE.2003.1198400
Usage of this product signifies your acceptance of the Terms of Use.