Similarity Search in High Dimensions via Hashing

by: Aristides Gionis, Piotr Indyk, Rajeev Motwani

(1999), pp. 518-529.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

zielaj, jsanpedro, markymaypo, inference-group (group), memoir (group), ARTFL (group), mat4saj

Find related articles with these CiteULike tags

clustering, dimensions, hash, hashing, high, identification, image, no-tag, search, similarity, video

Abstract

The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. Unfortunately, all known techniques for solving this problem fall prey to the "curse of dimensionality." That is, the data...

@inproceedings{citeulike:556224, abstract = {The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. Unfortunately, all known techniques for solving this problem fall prey to the \"curse of dimensionality.\" That is, the data...}, author = {Gionis, Aristides and Indyk, Piotr and Motwani, Rajeev }, booktitle = {The VLDB Journal}, citeulike-article-id = {556224}, keywords = {hash, identification, image, search, similarity, video}, pages = {518--529}, posted-at = {2007-07-30 16:24:12}, priority = {0}, title = {Similarity Search in High Dimensions via Hashing}, url = {http://citeseer.ist.psu.edu/203242.html}, year = {1999} }

RIS record

TY - CONF ID - citeulike:556224 L3 - citeulike-article-id:556224 TI - Similarity Search in High Dimensions via Hashing T2 - The VLDB Journal SP - 518 EP - 529 N2 - The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. Unfortunately, all known techniques for solving this problem fall prey to the "curse of dimensionality." That is, the data... KW - hash KW - identification KW - image KW - search KW - similarity KW - video AU - Gionis, Aristides AU - Indyk, Piotr AU - Motwani, Rajeev PY - 1999/// UR - http://citeseer.ist.psu.edu/203242.html ER -

RIS BibTeX