Streaming Similarity Search over One Billion Tweets Using Parallel Locality-Sensitive Hashing
Finding nearest neighbors has become an important operation on databases, with applications to text search, multimedia indexing, and many other areas. One popular algorithm for similarity search, especially for high dimensional data (where spatial indexes like kd-trees do not perform well) is Locali...
| Main Authors: | , , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery (ACM)
2014
|
| Online Access: | http://hdl.handle.net/1721.1/86923 https://orcid.org/0000-0002-7470-3265 https://orcid.org/0000-0002-7983-9524 |