The continuous development of wireless networks and mobile devices has motivated an
intense research in mobile data services. Some of these services provide the user with …

Identifying the queried object, from a large volume of given uncertain dataset, is a tedious
task which involves time complexity and computational complexity. To solve these …

The area of similarity searching is a very hot topic for both research and c-mercial
applications. Current data processing applications use data with c-siderably less structure …

Publisher Summary A continuous nearest neighbor query retrieves the nearest neighbor
(NN) of every point on a line segment. The result contains a set of tuples, such that point is …

In moving object environments, it is infeasible for the database tracking the movement of
objects to store the exact locations of objects at all times. Typically, the location of an object …

In this paper, we attempt to approximate and index a d-dimensional (d≥ 1) spatio-temporal
trajectory with a low order continuous polynomial. There are many possible ways to choose …

With the continued proliferation of wireless communications and advances in positioning
technologies, algorithms for efficiently answering queries about large populations of moving …

Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point
(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three …

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 …

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 …