Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/enhanced-nearest-neighbour-search-on-the-r-tree-kJmXmdrHST
References (17)
-
T. Chiueh (1994)
Content-Based Image Indexing -
S. Brin (1995)
Near Neighbor Search in Large Metric Spaces -
Virginia Ogle, M. Stonebraker (1995)
Chabot: Retrieval from a Relational Database of ImagesComputer, 28
-
C. Faloutsos, King-Ip Lin (1995)
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets -
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching -
N. Roussopoulos, Stephen Kelley, F. Vincent (1995)
Nearest neighbor queries -
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles -
T. Sellis, N. Roussopoulos, C. Faloutsos (1987)
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects -
(1998)
SIGMOD Record -
Stefan Berchtold, C. Böhm, D. Keim, H. Kriegel (1997)
A cost model for nearest neighbor search in high-dimensional data space -
Stefan Berchtold, C. Böhm, Bernhard Braunmüller, D. Keim, H. Kriegel (1997)
Fast parallel similarity search in multimedia databases -
M. Flickner, H. Sawhney, J. Ashley, Qian Huang, B. Dom, M. Gorkani, J. Hafner, Denis Lee, D. Petkovic, David Steele, P. Yanker (1995)
Query by Image and Video Content: The QBIC SystemComputer, 28
-
H. Samet (1989)
The Design and Analysis of Spatial Data Structures -
(1996)
Similarity indexing with the SS-tree -
J. Friedman, J. Bentley, R. Finkel (1976)
An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Trans. Math. Softw., 3
-
Stefan Berchtold, D. Keim, H. Kriegel (2001)
The X-tree : An Index Structure for High-Dimensional Data -
A. Brink, Sherry Marcus, V. Subrahmanian (1995)
Heterogeneous Multimedia ReasoningComputer, 28
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1998 by ACM Inc.
- ISSN
- 0163-5808
- DOI
- 10.1145/290593.290596
- Publisher site
- See Article on Publisher Site
Abstract
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that efficient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have been used in previous R*-tree work, which we prove cannot improve on the pruning power during a search.
Journal
ACM SIGMOD Record – Association for Computing Machinery
Published: Sep 1, 1998