A Graphics Hardware Accelerated Algorithm for Nearest Neighbor Search
We present a GPU algorithm for the nearest neighbor search, an important database problem. The search is completely performed using the GPU: No further post-processing using the CPU is needed. Our experimental results, using large synthetic and real-world data sets, showed that our GPU algorithm is several times faster than its CPU version.
- 1.Sun, C., Agrawal, D., Abbadi, A.: Hardware acceleration for spatial selections and joins. In: Proc. ACM Intl. Conf. on Managment of Data, pp. 455–466 (2003)Google Scholar
- 2.Bandi, N., Sun, C., Abbadi, A., Agrawal, D.: Hardware acceleration in commercial databases: A case study of spatial operations. In: Proc. Intl. Conf. on Very Large Databases, pp. 1021–1032. Morgan Kaufmann, San Francisco (2004)Google Scholar
- 3.Govindaraju, N., Lloyd, B., Wang, W., Lin, M., Manocha, D.: Fast computation of database operations using graphics processors. In: Proc. ACM Intl. Conf. on Managment of Data, pp. 215–226 (2004)Google Scholar
- 6.Hettich, S., Bay, S.: The UCI KDD archive (1999), http://kdd.ics.uci.edu