Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of
points, is an important and widely studied problem in many fields, and it has a wide range of …

Location-based social networks grow at a remarkable pace. Current location-aware mobile
devices enable us to access these networks from anywhere and to connect to friends via …

Aggregate nearest neighbor (ANN) query has been studied in both the Euclidean space and
road networks. The flexible aggregate nearest neighbor (FANN) problem further generalizes …

A socio spatial group query finds a group of users who possess strong social connections
with each other and have the minimum aggregate spatial distance to a meeting point …

Given a setS of multidimensional objects and a query object q, ak nearest neighbor (kNN)
query finds from S the k closest objects to q. This query is a fundamental problem in …

Aggregate nearest neighbor (Ann) query in both the euclidean space and road networks has
been extensively studied, and the flexible aggregate nearest neighbor (Fann) problem …

In part due to the proliferation of GPS-equipped mobile devices, massive svolumes of geo-
tagged streaming text messages are becoming available on social media. It is of great …

Finding an optimal meeting point (OMP) for a group of people (or a set of objects) at different
locations is an important problem in spatial query processing. There are many real-life …

Group k-nearest neighbor (kGNN) search allows a group of n mobile users to jointly retrieve
k points from a location-based service provider (LSP) that minimizes the aggregate distance …

Given a group QQ of query points and a set PP of points of interest (POIs), aggregate
nearest neighbor (ANN) queries find a POI p from PP that achieves the smallest aggregate …