Enhanced nearest neighbour search on the R-tree

@article{Cheung1998EnhancedNN,
  title={Enhanced nearest neighbour search on the R-tree},
  author={King Lum Cheung and Ada Wai-Chee Fu},
  journal={SIGMOD Rec.},
  year={1998},
  volume={27},
  pages={16-21}
}
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… 
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
TLDR
This work investigates the use of a distance-based indexing method, the vantage point tree (vp-tree) method, and applies an n-nearest neighbors search algorithm for the vp-tree, which is shown by experiments to scale up well with the size of the dataset and the desired number of nearest neighbors.
Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
TLDR
The first Best-First based Parallel kNN (BFPkNN) query algorithm in a multi-disk setting, for efficient handling of kNN retrieval with arbitrary values of k by parallelization.
Search Space Reduction in R-trees
Pruning plays an integral role in reducing the search space of nearest neighbor queries on data structures like the R-tree. We show that a popular pruning strategy for nearest queries can reduce the
A performance comparison of distance-based query algorithms using R-trees in spatial databases
TLDR
New pruning mechanism is proposed to apply in the design of new Recursive Best-First Search (RBFS) algorithms for DBQs between spatial objects indexed in R-trees to improve the efficiency of proposed RBFS algorithm and its comparison with respect to other search algorithms.
Efficient k nearest neighbor queries on remote spatial databases using range estimation
  • Danzhou Liu, Ee-Peng Lim, W. Ng
  • Computer Science
    Proceedings 14th International Conference on Scientific and Statistical Database Management
  • 2002
TLDR
A k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point and two different methods to estimate the ranges to be used by the window queries are proposed.
Efficient query processing on large spatial databases: A performance study
TLDR
It is demonstrated through extensive experimental performance results (I/O efficiency and execution time), based on medium and large real and synthetic datasets, that the xBR+-tree is a big winner in execution time in all cases and a winner in I/O in most cases.
An Efficient Method for k Nearest Neighbor Searching in Obstructed Spatial Databases
TLDR
This paper presents a grid-partition index combined with the obstructed voronoi diagram which can be pre-computed off-line and demonstrates the superior efficiency of the kNN query processing algorithms based on the real data sets.
Towards nearest collection search on spatial databases
TLDR
The efficiency and effectiveness of the proposed NC query processing based on the branch and bound method using an aggregate R-tree (simply aR-tree) are shown.
A Unified Approximate Nearest Neighbor Search Scheme by Combining Data Structure and Hashing
TLDR
This paper proposes a novel unified approximate nearest neighbor search scheme to combine the advantages of both the effective data structure and the fast Hamming distance computation in hashing methods so that the searching procedure can be further accelerated.
Processing Incomplete k Nearest Neighbor Search
TLDR
This paper formalizes this problem and proposes an efficient lattice partition algorithm using the authors' newly developed LαB index to support exact IkNN retrieval, with the help of two pruning heuristics, i.e., α value pruning and partial distance pruning.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Similarity indexing with the SS-tree
  • David A. White, R. Jain
  • Computer Science
    Proceedings of the Twelfth International Conference on Data Engineering
  • 1996
TLDR
This work describes the fundamental types of "similarity queries" that should be supported and proposes a new dynamic structure for similarity indexing called the similarity search tree or SS-tree, which performs better than the R*-tree in nearly every test.
Content-Based Image Indexing
We formulate the content-based image indexing problem as a multi-dimensional nearest-neighbor search problem, and develop/implement an optimistic vantage-point tree algorithm that can dynamically
R-trees: a dynamic index structure for spatial searching
TLDR
A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
Fast parallel similarity search in multimedia databases
TLDR
This paper presents a new parallel method for fast nearest-neighbor search in high-dimensional feature spaces, which provides an almost linear speed-up and a constant scale-up, and outperforms the Hilbert approach by a factor of up to 5.
An Algorithm for Finding Best Matches in Logarithmic Expected Time
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
Nearest neighbor queries
TLDR
This paper presents an efficient branch-and-bound R-tree traversal algorithm to find the nearest neighbor object to a point, and then generalizes it to finding the k nearest neighbors.
A cost model for nearest neighbor search in high-dimensional data space
TLDR
A new cost model for nearest neighbor search in high-dimensional data space is developed which takes boundary effects into account and therefore also works in high dimensions and is applicable to different data distributions and index structures.
The X-tree : An Index Structure for High-Dimensional Data
TLDR
A new organization of the directory is introduced which uses a split algorithm minimizing overlap and additionally utilizes the concept of supernodes to keep the directory as hierarchical as possible, and at the same time to avoid splits in the directory that would result in high overlap.
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
TLDR
A fast algorithm to map objects into points in some k-dimensional space (k is user-defined), such that the dis-similarities are preserved, and this method is introduced from pattern recognition, namely, Multi-Dimensional Scaling (MDS).
Chabot: Retrieval from a Relational Database of Images
TLDR
This work presents an approach that integrates a relational database retrieval system with a color analysis technique, and shows how a coarse granularity is used for content analysis improves the ability to retrieve images efficiently.
...
1
2
...