Location-based services (LBSs), considered as a killer application in the wireless data
market, provide information based on locations specified in the queries. In this paper, we …

An all-nearest-neighbors (ANN) query retrieves all nearest neighbors to all query objects.
We may perform large number of one-nearest-neighbor queries to answer such an ANN …

Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN)
query returns the set of objects in the database that have q as their nearest neighbor. In this …

Integration of Web search with geographic information has recently attracted much attention.
There are a number of local Web search systems enabling users to find location-specific …

The Voronoi diagram is an important technique for answering nearest-neighbor queries for
spatial databases. In this paper, we study how the Voronoi diagram can be used on …

In Voronoi-based nearest neighbor search, the Voronoi cell of every point p in a database
can be used to check whether p is the closest to some query point q. We extend the notion of …

In modern geographic information systems, route search represents an important class of
queries. In route search related applications, users may want to define a number of traveling …

Efficient processing of continual range queries over moving objects is critically important in
providing location-aware services and applications. A set of continual range queries, each …

The most common problem on routing networks is to compute the shortest paths from a
source vertex to a set of target vertices. A variation of it, with applications for recommender …

Given a set of criterions, an object o dominates another object ó if o is more preferable than
ó according to every criterion. A skyline query returns every object that is not dominated by …