Sergey Brin  Home/Search
Context Related
| stanford.edu/pub/papers/near.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/pub/dbpubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given user data, one often wants to find approximate matches in a large database. A good example of such a task is finding images similar to a given image in a large collection of images. We focus on the important and technically difficult case where each data element is high dimensional, or more generally, is represented by a point in a large metric spaceand distance calculations are computationally expensive. In this paper we introduce a data structure to solve this problem called a GNAT --... (Update)
Similar documents based on text: More All
0.2: Near Neighbor Search in Large Metric Spaces - Brin (1995) (Correct)
0.1: The GNAT project : A GNU-Ada9X compiler - The Gnat (Correct)
0.1: An Experimental Testbed for Embedded Real Time Ada 95 - Walker, Woolley, Burns (1999) (Correct)
Related documents from co-citation: More All
41: Distance-based indexing for highdimensional metric spaces - Bozkaya, Ozsoyoglu - 1997
38: Data structures and algorithms for nearest neighbor search in general metric spa.. - Yianilos - 1993
34: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
BibTeX entry: (Update)
S. Brin. Near neighbor search in large metric spaces. In Proc. VLDB'95, pages 574--584, 1995. http://citeseer.ist.psu.edu/brin95near.html More
@inproceedings{ brin95near,
author = "Sergey Brin",
title = "Near Neighbor Search in Large Metric Spaces",
booktitle = "The {VLDB} Journal",
pages = "574--584",
year = "1995",
url = "citeseer.ist.psu.edu/brin95near.html" }
Citations (may not include all citations):165 Comparing images using the hausdorff distance - Huttenlocher, Klanderman et al. - 1993
85 Data structures and algorithms for nearest neighbor search i.. - Yianilos - 1993
64 A branch and bound algorithm for computing k-nearest neighbo.. (context) - Fukunaga, Narendra - 1975
55 Some approaches to best-match file searching (context) - Burkhard, Keller - 1973
52 Approximate string matching with q-grams and maximal matches (context) - Ukkonen - 1992
35 New techniques for best-match retrieval (context) - Shasha, Wang - 1990
29 Satisfying general proximity / similarity queries with metri.. (context) - Uhlmann - 1991
14 The nearest neighbor problem in an abstract metric space (context) - Feustel, Shapiro - 1982
8 A spatial index for approximate multiple string matching (context) - Bugnion, Fei et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-db.stanford.edu/pub/dbpubs.html): More
Managing Semantic Heterogeneity with Production Rules and.. - Ceri, Widom (1993) (Correct)
Behavior of Database Production Rules: Termination.. - Aiken, Widom.. (1992) (Correct)
Correspondence and Translation for Heterogeneous Data - Abiteboul, Cluet, Milo (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC