Reverse kNN Search in Arbitrary Dimensionality

By Yufei Tao, Dimitris Papadias, Xiang Lian. Very Large Data Bases Conference, 2004

305 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Efficient Computation of Reverse Skyline Queries (2007, methodology): “[21] propose a method which utilize a conventional data-partitioning index (e.”
A Survey on Trajectory Data Management, Analytics, and Learning (2020, methodology): “ueryQ, a RkNN(Q)retrieves all transitionsT ∈D, such that ∀T,Q ∈kNN(T). Reversek Nearest Neighbors (RkNN) queries for spatial point data have attracted considerable attention in the research community [155] as it can be used to solve a wide variety of industryrelevant problems. An RkNN query aims to ”
Monitoring k-nearest neighbor queries over moving objects (2005, methodology): “For future work, we would like to extend the (hierarchical) Object-Indexing and Query-Indexing methods to handle other variations of k-NN queries, such as reverse k-NN queries[1, 20], and group NN queries[12].”