과제정보
연구 과제 주관 기관 : 정보통신산업진흥원
참고문헌
- A. Guttman, "R-trees: a dynamic index structure for spatial searching," Proc. of the 1984 ACM SIGMOD international conference on Management of data, pp. 47-57, 1984.
- T. K. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-Tree: A Dynamic Index for Multi-Dimensional Objects," Proc. of the 13th International Conference on VLDB, pp. 507-518, 1987.
- N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles," Proc. of the 1990 ACM SIGMOD international conference on Management of data, pp. 322-331, 1990.
- S. Berchtold, , D. A. Keim, and H.-P. Kriegel, "The X-tree: An index structure for high-dimensional data," Proc. of the 22th International Conference on VLDB, pp. 28-39, 1996.
- R. Zhang, and M. Stradling, "The hv-tree: a memory hierarchy aware version index," Proc. of the VLDB Endowment, Vol. 3, pp. 397-408, 2010.
- I. KAMEL, and C. Faloutsos, "Hilbert R-tree: An Improved R-tree Using Fractals," Proc. of the 20th International Conference on VLDB, pp. 500-509, 1994.
- L. Luo, M. D. Wong, and L. Leong, "Parallel implementation of R-trees on the GPU," Proc. of the 17th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 353-358, 2012.
- M. Kim, and W. Choi, "Range Query Method of R-tree for Efficient Parallel Processing on GPU," Journal of KIISE: Computing Practices and Letters, Vol. 18, Issue 5, pp. 409-413, 2012. (in Korean)
- R. Bayer, and E. McCreight. "Organization and maintenance of large ordered indexes," Acta Informatica, Vol. 1, Issue 3, pp. 173-189, 1972. https://doi.org/10.1007/BF00288683
- D. kirk, and W. Hwu, Programming massively parallel processors: a hands-on approach, Newnes, 2012.
- D. Horn, GPU Gems 2, pp. 573-589, Addison-Wesley, 2005.