In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning
Query (TPQ). Given a set of points of interest P in space, where each point belongs to a …

This work addresses a novel spatial keyword query called the m-closest keywords (mCK)
query. Given a database of spatial objects, each tuple is associated with some descriptive …

Spatial relationships are core components in the design and definition of spatial queries. A
spatial relationship determines how two or more spatial objects are related or connected in …

Given a set of objects P and a query point q, ak nearest neighbor (k-NN) query retrieves the
k objects in P that lie closest to q. Even though the problem is well-studied for static datasets …

Many location-based applications require constant monitoring of k-nearest neighbor (k-NN)
queries over moving objects within a geographic area. Existing approaches to this problem …

In this article, we present a new privacy-aware query processing framework, Capser*, in
which mobile and stationary users can obtain snapshot and/or continuous location-based …

Given two spatial datasets P (eg, facilities) and Q (queries), an aggregate nearest neighbor
(ANN) query retrieves the point (s) of P with the smallest aggregate distance (s) to points in …

Real-world road-planning applications often result in the formulation of new variations of the
nearest neighbor (NN) problem requiring new solutions. In this paper, we study an …

Aggregate nearest neighbor queries return the object that minimizes an aggregate distance
function with respect to a set of query points. Consider, for example, several users at specific …

Skyline query processing has been investigated extensively in recent years, mostly for only
one query reference point. An example of a single-source skyline query is to find hotels …