CORR

1999

Springer

13 years 7 months ago
1999

Springer

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...

ALENEX

2001

13 years 9 months ago
2001

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...

EDBT

2009

ACM

13 years 11 months ago
2009

ACM

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...

DASFAA

2010

IEEE

14 years 20 days ago
2010

IEEE

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...

SSDBM

2008

IEEE

14 years 1 months ago
2008

IEEE

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...

ICDE

2010

IEEE

14 years 2 months ago
2010

IEEE

— 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...

SIGMOD

2005

ACM

14 years 7 months ago
2005

ACM

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...