LINEAR R-TREE REVISITED

A. Al-Badarneh and M. Tawil

References

  1. [1] S. SheKhar & S. Chawla, Spatial databases: A tour (Englewood, NJ: Prentice-Hall, 2003).
  2. [2] D. Comer, The ubiquitous B-tree, ACM Computing Surveys, 11(2), 1979, 121–137.
  3. [3] V. Gaede & O. Gunther, Multidimensional access methods, ACM Computing Surveys, 30(2), 1998, 170–231.
  4. [4] A. Guttman, R-trees: A dynamic index structure for spatial searching, Proc. ACM SIGMOD, 1984, 47–54.
  5. [5] N. Beckmann, H.-P. Kriegel, R. Schneider, & B. Seeger, The R∗-tree: An efficient and robust access method for points and rectangles, Proc. ACM SIGMOD, 1990, 322–331.
  6. [6] S. Brakatsoulas, D. Pfoser, & Y. Theodoridis, Revisiting R-tree construction principles, Advances in Databases and Information Systems, 6th East European Conf., 2002, 149–162.
  7. [7] I. Kamel & C. Faloustsos, Hilbert R-tree: An improved R-tree using fractals, Proc. 20th Int. Conf. Very Large Data Bases, 1994, 500–509.
  8. [8] J. Garcia, A. Lopez, & T. Leutenegger, On optimal nodesplitting for R-trees, Proc. 24th Int. Conf. Very Large Data Bases, 1998, 334–344.
  9. [9] T. Sellis, N. Roussopoulos, & C. Faloutsos, The R+-tree: A dynamic index for multi-dimensional objects, Proc. 13th Int. Conf. Very Large Data Bases, 1987, 507–518.
  10. [10] T. Schreck & Z. Chen, Branch grafting method for R-tree implementation, The Journal of Systems and Software, 53, 2000, 83–93.
  11. [11] W. Huang, P.L. Lin, & H.Y. Lin, Optimizing storage utilization in R-tree dynamic index structure for spatial databases, Journal of Systems and Software, 55, 2001, 291–299.
  12. [12] C. Ang & T. Tan, New linear node splitting algorithm for R-trees, Proc. 5th Int. Symposium on Advances in Spatial Databases, 1997, 339–349. 82
  13. [13] F. Brabec & H. Samet, Visualizing and animating R-trees and spatial operations in spatial databases on the world wide web, Proc. 4th Int. Conf. Visual Database Systems, 1998, 147–153.
  14. [14] Y. Manolopoulos, A. Nanopoulos, A. Papadopoulos, &Y. Theodoridis, R-trees: Theory and applications (Berlin:Springer, 2005).
  15. [15] O. Gunther & V. Gaede, Oversize shelves: A storage management technique for large spatial data objects, International Journal of Geographic Information Systems, 11(1), 1997, 5–32.
  16. [16] Lu. Guojun, Techniques and data structures for efficient multimedia retrieval based on similarity, IEEE Transactions on Multimedia, 4(3), 2002, 372–384.
  17. [17] S. Berman, R. Southern, A. Vasey, & D. Ziskind, Spatiotemporal access in persistent Java, Proc. 3rd Int. Workshop on Persistence and Java, 1998, 250–258.
  18. [18] TIGER/Line TM Files, 2005 Technical Documentation, USBureau of Census, Washington, DC, accessible via URLhttp://www.census.gov/geo/www/tiger/
  19. [19] D. Green, An implementation and performance analysis of spatial data access methods, Proc. 5th Int. Conf. Data Engineering, 1989, 606–615.
  20. [20] L. Arge, M. Berg, H. Haverkort, & Ke Yi Ke, The priority R-tree: A practically efficient and worst-case optimal R-tree, Proc. ACM SIGMOD, 2004, 347–358.

Important Links:

Go Back