Fast GPU-based locality sensitive hashing for k-nearest neighbor computation

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2011, Pages 211-220

  Pan, Jia ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DIMENSIONAL VECTORS; GPU IMPLEMENTATION; HASH TABLE; HIGH DIMENSIONAL SPACES; K-NEAREST NEIGHBORS; LARGE IMAGES; LOCALITY SENSITIVE HASHING; PARALLELIZATIONS; SECOND LEVEL;

ALGORITHMS; GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION SYSTEMS; MEMBERSHIP FUNCTIONS; TEXT PROCESSING; TREES (MATHEMATICS);

COMPUTATIONAL EFFICIENCY;

EID: 84856462102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2093973.2094002     Document Type: Conference Paper

References (44)

1. D. A. Alcantara, A. Sharf, F. Abbasinejad, S. Sengupta, M. Mitzenmacher, J. D. Owens, and N. Amenta. Real-time parallel hashing on the GPU. ACM Transations on Graphics, 28:154:1-154:9, 2009.
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In Symposium on Foundations of Computer Science, pages 459-468, 2006.
3. M. Bawa, T. Condie, and P. Ganesan. LSH forest: self-tuning indexes for similarity search. In International Conference on World Wide Web, pages 651-660, 2005.
4. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. In Symposium on Theory of Computing, pages 537-546, 2008.
5. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Symposium on Computational Geometry, pages 253-262, 2004.
6. K. Deng, X. Zhou, H. T. Shen, Q. Liu, K. Xu, and X. Lin. A multi-resolution surface distance model for k-nn query processing. The VLDB Journal, 17:1101-1119, 2008.
7. A. Dhesi and P. Kar. Random projection trees revisted. In Advances in Neural Information Processing Systems, 2010.
8. W. Dong, Z. Wang, W. Josephson, M. Charikar, and K. Li. Modeling LSH for performance tuning. In Conference on Information and Knowledge Management, pages 669-678, 2008.
9. O. Egecioglu and B. Kalantari. Approximating the diameter of a set of points in the euclidean space. Information Processing Letters, 32:205-211, 1989. (Pubitemid 20608568)
10. Y. Freund, S. Dasgupta, M. Kabra, and N. Verma. Learning the structure of manifolds using random projections. In Advances in Neural Information Processing Systems, 2007.
11. V. Garcia, E. Debreuve, and M. Barlaud. Fast k nearest neighbor search using GPU. In CVPR Workshop on Computer Vision on GPU, 2008.
12. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518-529, 1999.
13. D. Guo, D. J. Peuquet, and M. Gahegan. ICEDAGE: Interactive clustering and exploration of large and high-dimensional geodata. GeoInformatica, 7(3):229-253, 2003. (Pubitemid 37212162)
14. B. He, N. K. Govindaraju, Q. Luo, and B. Smith. Efficient gather and scatter operations on graphics processors. In International Conference on Supercomputing, 2007.
15. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24:265-318, 1999.
16. K. E. Hoff, III, J. Keyser, M. Lin, D. Manocha, and T. Culver. Fast computation of generalized voronoi diagrams using graphics hardware. In SIGGRAPH, pages 277-286, 1999.
17. D. Horn. Stream reduction operations for GPGPU applications. In GPU Gems 2, pages 573-589. Addison Wesley, 2005.
18. L. Hu, W.-S. Ku, S. Bakiras, and C. Shahabi. Verifying spatial queries using voronoi neighbors. In SIGSPATIAL GIS, pages 350-359, 2010.
19. J. JáJá. An introduction to parallel algorithms. Addison Wesley Longman Publishing Co., Inc., 1992.
20. H. Jégou, L. Amsaleg, C. Schmid, and P. Gros. Query adaptative locality sensitive hashing. In International Conference on Acoustics, Speech and Signal Processing, pages 825-828, 2008.
21. A. Joly and O. Buisson. A posteriori multi-probe locality sensitive hashing. In International Conference on Multimedia, pages 209-218, 2008.
22. K. Kaligosi, K. Mehlhorn, J. Munro, and P. Sanders. Towards optimal multiple selection. In International Colloquium on Automata, Languages and Programming, pages 103-114, 2005.
23. K. Kato and T. Hosino. Multi-GPU algorithm for k-nearest neighbor problem. Concurrency and Computation: Practice and Experience, 23, 2011.
24. J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In Symposium on Theory of Computing, pages 599-608, 1997.
25. D. E. Knuth. The art of computer programming, volume 3: sorting and searching. Addison Wesley Longman Publishing Co., Inc., 1998.
26. M. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB, pages 840-851, 2004.
27. C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, and D. Manocha. Fast BVH construction on GPUs. Computer Graphics Forum, 28(2):375-384, 2009.
28. C. Lauterbach, Q. Mo, and D. Manocha. gProximity: Hierarchical GPU-based operations for collision and distance queries. Computer Graphics Forum, 29(2):419-428, 2010.
29. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe LSH: efficient indexing for high-dimensional similarity search. In VLDB, pages 950-961, 2007.
30. D. G. Merrill and A. S. Grimshaw. Revisiting sorting for GPGPU stream architectures. In International Conference on Parallel architectures and compilation techniques, pages 545-546, 2010.
31. R. Pagh and F. F. Rodler. Cuckoo hashing. Journal of Algorithms, 51:122-144, 2004.
32. J. Pan, C. Lauterbach, and D. Manocha. Efficient nearest-neighbor computation for GPU-based motion planning. In International Conference on Intelligent Robots and Systems, pages 2243-2248, 2010.
33. J. Pan and D. Manocha. Bi-level locality sensitive hashing for k-nearest neighbor computation. Technical report, Computer Science Department, UNC Chapel Hill, 2011.
34. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB, pages 802-813, 2003.
35. V. N. Rao and V. Kumar. Concurrent access of priority queues. IEEE Transactions on Computers, 37:1657-1665, 1988.
36. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., 2005.
37. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan primitives for GPU computing. In Symposium on Graphics Hardware, pages 97-106, 2007.
38. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. In SIGSPATIAL GIS, pages 94-100, 2002.
39. C. Shahabi, L.-A. Tang, and S. Xing. Indexing land surface for efficient knn query. Proceedings of the VLDB Endowment, 1:1020-1031, 2008.
40. A. Sud, N. Govindaraju, R. Gayle, I. Kabul, and D. Manocha. Fast proximity computation among deformable models using discrete voronoi diagrams. ACM Transactions on Graphics, 25:1144-1153, 2006. (Pubitemid 44481078)
41. H. Sundell and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. Journal of Parallel and Distributed Computing, 65:609-627, 2005. (Pubitemid 40423896)
42. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, pages 194-205, 1998.
43. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Advances in Neural Information Processing Systems, 2008.
44. K. Zhou, Q. Hou, R. Wang, and B. Guo. Real-time kd-tree construction on graphics hardware. In SIGGRAPH Asia, pages 126:1-126:11, 2008.