Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Abstract. In recent years, there is an increasing need to monitor k nearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a...
Lu Qin, Jeffrey Xu Yu, Bolin Ding, Yoshiharu Ishik...
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...