Inproceedings,

GPU-based minwise hashing: GPU-based minwise hashing

, , and .
Proceedings of the 21st World Wide Web Conference (WWW 2012) (Companion Volume), page 565-566. (2012)
DOI: 10.1145/2187980.2188129

Abstract

Minwise hashing is a standard technique for efficient set similarity estimation in the context of search. The recent work of b-bit minwise hashing provided a substantial improvement by storing only the lowest b bits of each hashed value. Both minwise hashing and b-bit minwise hashing require an expensive preprocessing step for applying k (e.g., k=500) permutations on the entire data in order to compute k minimal values as the hashed data. In this paper, we developed a parallelization scheme using GPUs, which reduced the processing time by a factor of 20-80. Reducing the preprocessing time is highly beneficial in practice, for example, for duplicate web page detection (where minwise hashing is a major step in the crawling pipeline) or for increasing the testing speed of online classifiers (when the test data are not preprocessed).

Tags

Users

  • @ncrn-cornell

Comments and Reviews