A fast similarity join algorithm using graphics processing units

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 1111-1120

  Lieberman, Michael D ^a   Sankaranarayanan, Jagan ^a   Samet, Hanan ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ENGINEERING; GRAPHICS PROCESSING UNITS; INTERNATIONAL CONFERENCES; SIMILARITY JOIN;

TECHNOLOGY;

EID: 52649161208     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497520     Document Type: Conference Paper

References (32)

1. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds., Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, 1996.
2. D. Jurafsky and J. H. Martin, Speech and language processing: An introduction to natural language processing, computational linguistics and speech recognition. Upper Saddle River, NJ: Prentice Hall, Jan. 2000.
3. K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd ed. Boston: Academic Press, 1990.
4. H. Samet, Foundations of Multidimensional and Metric Data Structures. San Francisco, CA: Morgan-Kaufmann, 2006.
5. S. Berchtold, C. Böhm, and H.-P. Kriegel, 'The pyramid-technique: towards breaking the curse of dimensionality," in SIGMOD'98, Seattle, WA, June 1998, pp. 142-153.
6. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in VLDB'99, Edinburgh, Scotland, Sept. 1999, pp. 518-529.
7. S. Liao, M. A. Lopez, and S. T. Leutenegger, "High dimensional similarity search with space filling curves," in ICDE'01, Heidelberg, Germany, Apr, 2001, pp. 615-622.
8. T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient processing of spatial joins using R-trees," in SIGMOD'93, Washington, DC, May 1993, pp. 237-246.
9. C. Böhm, B. Braunmuller, F. Krebs, and H.-P. Kriegel, "Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data," in SIGMOD'01, Santa Barbara, CA, May 2001, pp. 379-390.
10. J.-P, Dittrich and B. Seeger, "GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces," in KDD'01, San Francisco, CA, Aug. 2001, pp. 47-56.
11. D. V. Kalashnikov and S, Prabhakar, "Similarity join for low-and high-dimensional data," in DASFAA '03, Kyoto, Japan, Mar, 2003, pp. 7-16.
12. K. Shim, R. Srikant, and R. Agrawal, "High-dimensional similarity joins," in ICDE'97, Birmingham, U.K., Apr. 1997, pp. 301-311.
13. N. Koudas and K. C. Sevcik, "High dimensional similarity joins: algorithms and performance evaluation," TKDE, vol. 12, no. 1, pp. 3-18, January/February 2000.
14. H. Sagan, Space-Filling Curves. New York City, NY: Springer-Verlag, 1994.
15. M. Bem, "Approximate closest-point queries in high dimensions," IPL, vol. 45, no. 2, pp. 95-99, Feb. 1993.
16. T. M. Chan, "Approximate nearest neighbor queries revisited," in SCG'97, Nice, France, June 1997, pp. 352-358.
17. K. E. Batcher, "Sorting networks and their applications," in AFIPS Spring Joint Computing Conf., Atlantic City, NJ, Apr. 1968, pp. 307-314.
18. N. K. Govindaraju, N. Raghuvanshi, and D. Manocha, Tast and approximate stream mining of quantiles and frequencies using graphics processors," in SIGMOD'05, Baltimore, MD, June 2005, pp. 611-622.
19. N. K. Govindaraju, B. Lloyd, W. Wang, M. Lin, and D. Manocha, "Fast, computation of database operations using graphics processors," in SIGMOD'04, Paris, France, June 2004, pp. 215-226.
20. C. Sun, D. Agrawal, and A. El-Abbadi, "Hardware acceleration for spatial selections and joins," in SIGMOD'03, San Diego, CA, June 2003, pp. 455-166.
21. N. Bandi, C. Sun, A. El-Abbadi, and D. Agrawal, "Hardware acceleration in commercial databases: A case study of spatial operations." in VLDB'04, Toronto, Canada, Aug. 2004, pp. 1021-1032.
22. R. Fosner, Real-Time Shader Programming, Using DirectX 9.0. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2002.
23. R. Femando and M. J. Kilgard, The Cg Tutorial: The Definitive Guide to Programmable Real-Time Graphics. Boston, MA, USA: Addison -Wesley Longman Publishing Co., Inc., 2003.
24. NVIDIA Corporation, "NVIDIA CUDA Compute Unified Device Architecture programming guide," http://developer.nvidia.com/cuda.
25. G. M. Morton, "A computer oriented geodetic data base and a new technique in file sequencing," IBM Ltd., Ottawa, Canada, Tech. Rep., 1966.
26. I. Gargantini, "An effective way to represent quadtrees," CACM, vol. 25, no. 12, pp. 905-910, Dec. 1982.
27. H. Tropf and H. Herzog, "Multidimensional range search in dynamically balanced trees," Angewandte Informatik, vol. 23, no. 2, pp. 71-77, Feb. 1981.
28. M. A. Lopez and S, Liao, "Finding k-closest-pairs efficiently for high dimensional data," in CCCG'00, Fredericton, Canada, Aug. 2000, eproceedings.
29. G. E. Blelloch, "Prefix sums and their applications," in Synthesis of Parallel Algorithms, J. H. Reif, Ed. San Francisco, CA: Morgan Kaufmann, 1990, pp. 35-60.
30. U. Vishkin, 'Thinking in parallel: Some basic data-parallel algorithms and techniques," College Park, MD, 2007, http://www.umiacs.umd.edu/vishkin/ PUBLICATIONS/classnotes.pdf.
31. W. G. Aref and H. Samet, "Cascaded spatial join algorithms with spatially sorted output," in ACM-GIS '96, Gaithersburg, MD, Nov, 1996, pp. 17-24.
32. S. Hettich and S. D. Bay, "The UCI KDD Archive," http://kdd.ics.uci. edu, University of California, Irvine, CA.