Parallel implementation of R-trees on the GPU

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2012, Pages 353-358

  Luo, Lijuan ^a,b   Wong, Martin D F ^a   Leong, Lance ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b NVIDIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION METHOD; PARALLEL CONSTRUCTION; PARALLEL IMPLEMENTATIONS; PARTITION ALGORITHMS; R-TREES; SEQUENTIAL CONSTRUCTION; SPATIAL DATA STRUCTURE;

COMPUTER AIDED DESIGN; DATA STRUCTURES; FORESTRY;

DECISION TREES;

ALGORITHMS; DATA BASES; FORESTRY;

EID: 84859944365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2012.6164973     Document Type: Conference Paper

References (18)

1. J. Burns and M. Abbas, "EUV mask defect mitigation through pattern placement," in Proc. SPIE, Vol. 7823, Poster Session, Monterey, CA, Sep. 2010, p. 782340.
2. B. Schnitzer and S. T. Leutenegger, "Master-client R-trees: A new parallel R-tree architecture," in Proc. International Conference on Scientific and Statistical Database Management, Cleveland, OH, July 1999, pp. 68-77.
3. B. Wang, H. Horinokuchi, K. Kaneko, and A. Makinouchi, "Parallel Rtree search algorithm on DSVM," in Proc. International Conference on Database Systems for Advanced Applications, Hsinchu, Taiwan, 1999, pp. 237-244.
4. H. S. Erik and G. Hoel, "Performance of data-parallel spatial operations,"in Proc. International Conference on Very Large Data Bases, Santiago de Chile, Chile, Sep. 1994, pp. 156-167.
5. I. Kamel and C. Faloutsos, "Parallel R-trees," in Proc. ACM International Conference on Management of Data (SIGMOD'92), San Diego, CA, June 1992, pp. 195-204.
6. M. Kunjir and A. Manthramurthy, "Using graphics processing in spatial indexing algorithms," 2009. [Online]. Available: http://dsl.serc.iisc.ernet.in/ mayuresh/graphics-report.pdf
7. H. Alborzi and H. Samet, "Execution time analysis of a top-down R-tree construction algorithm," Inf. Process. Lett., vol. 101, no. 1, pp. 6-12, Jan. 2007.
8. A. Papadopoulos and Y. Manolopoulos, "Parallel bulk-loading of spatial data," Parallel Computing, vol. 29, no. 10, pp. 1419-1444, Oct. 2003.
9. A. Cary, Z. Sun, V. Hristidis, and N. Rishe, "Experiences on processing spatial data with MapReduce," in Proc. of the 21st International Conference on Scientific and Statistical Database Management, New Orleans, LA, June 2009, pp. 302-319.
10. A. Guttman, "R-trees: A dynamic index structure for spatial searching,"in Proc. ACM International Conference on Management of Data (SIGMOD'84), Boston, MA, June 1984, pp. 47-57.
11. I. Kamel, "On packing R-trees," in Proc. International Conference on Information and Knowledge Management, Washington, DC, Nov. 1993, pp. 490-499.
12. L. Luo, M. D. F. Wong, and W. Hwu, "An effective GPU implementation of breadth-first search," in Proc. ACM/IEEE Design Automation Conference (DAC'2010), Anaheim, CA, June 2010, pp. 52-55.
13. N. Roussopoulos and D. Leifker, "Direct spatial search on pictorial databases using packed R-trees," in Proc. ACM International Conference on Management of Data (SIGMOD'85), Austin, TX, May 1985, pp. 17-31.
14. Y. J. Garcia, M. A. Lopez, and S. T. Leutenegger, "A greedy algorithm for bulk loading R-trees," in Proc. ACM International Symp. on Advances in Geographic Information Systems (GIS'98), Washington, DC, Nov. 1993, pp. 490-499.
15. "NVIDIA CUDA SDK," 2009. [Online]. Available: http://www.nvidia.com/cuda
16. Y. Theodoridis, "The R-tree-portal," 2003. [Online]. Available: http://www.rtreeportal.org
17. [Online]. Available: http://superliminal.com/sources/sources.htm
18. P. Terdiman, "Radix sort revisited," 2000. [Online]. Available: http://www.codecorner.com/RadixSortRevisited.htm