CircularTrip: An Effective Algorithm for Continuous kNN Queries Muhammad Aamir Cheema Database Research Group, The School of Computer Science and Engineering,
Efficient Reverse k-Nearest Neighbors Retrieval with Local kNN-Distance Estimation Mike Lin.
Navigating Nets: Simple algorithms for proximity search Robert Krauthgamer (IBM Almaden) Joint work with James R. Lee (UC Berkeley)
Given by: Erez Eyal Uri Klein Lecture Outline Exact Nearest Neighbor search Exact Nearest Neighbor search Definition Definition Low dimensions Low dimensions.
Nearest Neighbor Queries Sung-hsun Su April 12, 2001 [1] Nick Roussopoulos, Stephen Kelley, Frederic Vincent: Nearest Neighbor Queries. SIGMOD Conference.
Privacy Preserving Query Processing in Cloud Computing Wen Jie 2011-5-27.
Point Location Dmitry Rusakov Boris Kronrod. Planar Point Location Lets S be a planar subdivision with n edges. The planar point location problem is.
Spatio-temporal Databases
Spatial Access Methods Chapter 26 of book Read only 26.1, 26.2, 26.6 Dr Eamonn Keogh
What is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Searching Dynamic Point Sets in Spaces with Bounded Doubling Dimension
Performance Comparison of xBR -trees and R*-trees for Single Dataset Spatial Queries