Add to ORKGAbstract. 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 search space exponentially in R-trees. In light of this, we provide a generalization of the strategy to k-nearest neighbors. We call the extension Promise-Pruning and, for any k, construct a class of R-trees where its application preserves the exponential search space reduction.
In various domains, such as computer games, robotics, and transportation networks, shortest paths ma...
Efficient nearest neighbor search in high dimensional spaces is a problem that has numerous practica...
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nea...
We consider the task of nearest-neighbor search with the class of binary-space-partitioning trees, w...
We consider the task of nearest-neighbor search with the class of binary-space-partitioning trees, w...
A simplified k nearest neighbour (knn) search for the R-tree family is proposed in this paper. This ...
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last...
Click on the DOI link to access the article (may not be free).The -d tree was one of the first spati...
Nearest neighbor search is a basic primitive method used for machine learning and information retrie...
Nearest neighbor search is a basic primitive method used for machine learning and information retrie...
Even with its significant impacts on the database area, the R-tree is often criticized by its lack o...
In various domains, such as computer games, robotics, and transportation networks, shortest paths ma...
Abstract: While k-d trees have been widely studied and used, their theoretical advantages are often...
This note presents a simplification and generalization of an algorithm for searching k-dimensional t...
A range nearest-neighbor (RNN) query retrieves the nearest neighbor (NN) for every point in a range....
In various domains, such as computer games, robotics, and transportation networks, shortest paths ma...
Efficient nearest neighbor search in high dimensional spaces is a problem that has numerous practica...
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nea...
We consider the task of nearest-neighbor search with the class of binary-space-partitioning trees, w...
We consider the task of nearest-neighbor search with the class of binary-space-partitioning trees, w...
A simplified k nearest neighbour (knn) search for the R-tree family is proposed in this paper. This ...
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last...
Click on the DOI link to access the article (may not be free).The -d tree was one of the first spati...
Nearest neighbor search is a basic primitive method used for machine learning and information retrie...
Nearest neighbor search is a basic primitive method used for machine learning and information retrie...
Even with its significant impacts on the database area, the R-tree is often criticized by its lack o...
In various domains, such as computer games, robotics, and transportation networks, shortest paths ma...
Abstract: While k-d trees have been widely studied and used, their theoretical advantages are often...
This note presents a simplification and generalization of an algorithm for searching k-dimensional t...
A range nearest-neighbor (RNN) query retrieves the nearest neighbor (NN) for every point in a range....
In various domains, such as computer games, robotics, and transportation networks, shortest paths ma...
Efficient nearest neighbor search in high dimensional spaces is a problem that has numerous practica...
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nea...