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 …

In this paper, we introduce obstructed group nearest neighbor (OGNN) queries, that enable
a group to meet at a point of interest (eg, a restaurant) with the minimum aggregate travel …

An optimal meeting point query is used to determine a location in a spatial region to build a
new facility that minimizes the sum of the (weighted) road distances from all clients. This …

Due to the wide spectrum of applications, the Min-dist location selection problem has drawn
much research attention in spatial database studies. Given a group of existing locations of a …

Given a set of data objects, a set of query points, a positive integer, and an aggregate
function (eg, sum, max, and min), an aggregate nearest neighbor query finds the data …

Finding optimal meeting points on road networks is becoming more and more relevant with
the growth of ride-sharing services. Optimal meeting points serve as locations where …

Aggregate nearest neighbor query, which returns an optimal target point that minimizes the
aggregate distance for a given query point set, is one of the most important operations in …

This paper studies the constrained-space probabilistic threshold range query (CSPTRQ) for
moving objects, where objects move in a constrained-space (ie, objects are forbidden to be …

In this paper, we introduce an obstructed group nearest neighbor (OGNN) query that
enables a group of pedestrians to meet at a common point of interest (eg, a restaurant) with …

针对障碍空间中不确定对象的组k 最近邻查询问题, 提出了PkOGNN (probabilistic k obstructed
group nearest neighbor query) 查询方法. PkOGNN 查询方法主要包括4 个子算法 …