The ubiquity of mobile location aware devices and the proliferation of social networks have
given rise to Location-Aware Social Networks (LASN), where users form social connections …

Advances in mobile technologies and map-based applications enables users to utilize
sophisticated spatial queries, including k-nearest neighbor and shortest path queries. Often …

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 …

This paper addresses the problem of searching the k aggregate farthest neighbours (A k FN
query in short) on road networks. Given a query point set, A k FN is aimed at finding the top-k …

With the rapid development of intelligent transportation and geographic information system,
spatial data query technology has attracted the attention of many scholars. Among them, the …

Finding the nearest neighbors and finding the farthest neighbors are fundamental problems
in spatial databases. Consider two sets of data points in a two-dimensional data space …

This paper considers k-farthest neighbor (k FN) join queries in spatial networks where the
distance between two points is the length of the shortest path connecting them. Given a …

While most research focuses on the k-nearest neighbors (kNN) queries in the database
community, an important type of proximity queries called k-farthest neighbors (kFN) queries …

Entering the era of big data, human beings are faced with an unprecedented amount of
geometric data today. Many computational challenges arise in processing the new deluge of …

Given a set of facilities F and a query point q, ak-farthest neighbor (k FN) query returns the k
farthest facilities f 1, f 1,⋯, fk from q. This study considers the moving k-farthest neighbor (M k …