This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Effect of Buffering on the Performance of R-Trees
January/February 2000 (vol. 12 no. 1)
pp. 33-44

Abstract—Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the number of disk accesses is a more realistic measure of performance. We develop a buffer model to analyze the number of disk accesses required for spatial queries using R-trees. The model can be used to evaluate the quality of R-tree update operations, such as various node splitting and tree restructuring policies, as measured by query performance on the resulting tree. We use our model to study the performance of three well-known R-tree loading algorithms. We show that ignoring buffer behavior and using number of nodes accessed as a performance metric can lead to incorrect conclusions, not only quantitatively, but also qualitatively. In addition, we consider the problem of how many levels of the R-tree should be pinned in the buffer.

[1] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[2] A. Bhide, A. Dan, and D. Dias, “A Simple Analysis of lru Buffer Replacement Policy and Its Relationship to Buffer Warm-Up Transient,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), 1993.
[3] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[4] I. Kamel and C. Faloutsos, “On Packing R-Trees,” Proc. Second Int'l Conf. Information and Knowledge Management (CIKM), 1993.
[5] I. Kamel and C. Faloutsos, "Hilbert R-Tree: An Improved R-Tree using Fractals," Proc. Int'l Conf. Very Large Data Bases, 1994.
[6] S.T. Leutenegger and M.A. Lopez, “The Effect of Buffering on the Performance of R-Trees,” Proc. 14th IEEE Int'l Conf. Data Eng. (ICDE), 1998.
[7] S.T. Leutenegger, M.A. Lopez, and J.M. Edgington, “Str: A Simple and Efficient Algorithm for R-Tree Packing,” Proc. Int'l Conf. Data Eng. (ICDE '97), pp. 497–506, Apr. 1997.
[8] D.J. Mavriplis, “An Advancing Front Delaunay Triangulation Algorithm Designed for Robustness,” J. Computational Physics, pp. 90-101, 1995.
[9] B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, “Towards an Analysis of Range Query Performance,” Proc. 12th ACM Symp. Principles of Database Systems (PODS), 1993.
[10] Y.J.R. Garcia, M.A. Lopez, and S.T. Leutenegger, “On Optimal Node Splitting for R-Trees,” Proc. Int'l Conf. Very Large Databases (VLDB '98), 1998.
[11] A.L. Rosenberg and L. Snyder, "Time and Space Optimality in B-Trees," ACM Trans. Database Systems, vol. 6, no. 1, Mar. 1981.
[12] N. Roussopoulos and D. Leifker, “Direct Spatial Search on Pictorial Databases Using Packed R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1985.
[13] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[14] Y. Theodoridis and T. Sellis, “A Model for the Prediction of R-tree Performance,” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.

Index Terms:
Analytical model, buffer model, multidimensional indexing, performance evaluation, R-tree.
Citation:
Scott T. Leutenegger, Mario A. López, "The Effect of Buffering on the Performance of R-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 1, pp. 33-44, Jan.-Feb. 2000, doi:10.1109/69.842248
Usage of this product signifies your acceptance of the Terms of Use.