See this document in CiteSeerX!

The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries (1997)  (Make Corrections)  (165 citations)
Norio Katayama, Shin'ichi Satoh



  Home/Search   Context   Related

 
View or download:
rd.nacsis.ac.jp/~kata...SIGMOD97.ps.gz
research.nii.ac.jp/~k...SIGMOD97.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rd.nacsis.ac.jp/~katayama/home... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Recently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries efficiently. The SS-tree had been proposed for this purpose and is known to outperform other index structures such as the R*-tree and the K-D-B-tree. One of its most important features is that it employs bounding spheres rather than bounding... (Update)

Cited by:   More
An Investigation of Practical Approximate Nearest Neighbor .. - Liu, Moore, Gray, Yang   (Correct)
Illumination Normalization with Time-Dependent.. - Matsushita.. (2004)   (Correct)
Tree: A Hyperplane-Based Index Method - For High-Dimensional Metric (2005)   (Correct)

Active bibliography (related documents):   More   All
0.0:   Multimedia Support for Databases - Özden, Rastogi, Silberschatz (1997)   (Correct)
0.0:   The A-tree: An Index Structure for High-Dimensional Spaces Using .. - Masatoshi (2000)   (Correct)
0.0:   Integrating New Document Types into Digital Libraries - Mönch, Drobnik (1998)   (Correct)

Similar documents based on text:   More   All
0.3:   Distinctiveness-Sensitive Nearest-Neighbor Search for.. - Katayama, Satoh (2001)   (Correct)
0.3:   Comparative Evaluation of Face Sequence Matching for Content-based .. - Satoh (2000)   (Correct)
0.3:   Significance-Sensitive Nearest-Neighbor Search for Efficient.. - Katayama, Satoh   (Correct)

Related documents from co-citation:   More   All
64:   trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
61:   Similarity indexing with the ss-tree (context) - White, Jain - 1996
52:   tree: an efficient and Robust Access Method for Points and Rectangles (context) - Beckmann, Kriegel et al. - 1990

BibTeX entry:   (Update)

N. Katayama and S. Satoh, "The sr-tree: An index structure for high-dimensional nearest neighbor queries," Proceedings of ACM SIGMOD , May 1997. http://citeseer.ist.psu.edu/katayama97srtree.html   More

@inproceedings{ katayama97srtree,
    author = "Norio Katayama and Shin'ichi Satoh",
    title = "The {SR-tree}: an index structure for high-dimensional nearest neighbor queries",
    pages = "369--380",
    year = "1997",
    url = "citeseer.ist.psu.edu/katayama97srtree.html" }
Citations (may not include all citations):
643   Query by Image and Video Content: the QBIC System (context) - Flickner, Sawhney et al. - 1995
162   Similarity Indexing with the SS-tree (context) - White, Jain - 1996
76   Intelligent Access to Digital Video: Informedia Project (context) - Wactlar, Kanade et al. - 1996
1   tree: an Efficient and Robust Access (context) - Beckmann, Kriegel et al.



The graph only includes citing articles where the year of publication is known.


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