Continuous Aggregate Nearest Neighbor Queries

This paper addresses the problem of continuous aggregate nearest neighbor (CANN) queries for moving objects in spatio-temporal data stream management systems. A CANN query specifies a set of landmarks, an integer k, and an aggregate distance function f (e.g., min, max, or sum), where f computes the aggregate distance between a moving object and each of the landmarks. The answer to this continuous query is the set of k moving objects that have the smallest aggregate distance f. A CANN query may also be viewed as a combined set of nearest neighbor queries.

Provided by: National Science Foundation Topic: Data Management Date Added: Nov 2011 Format: PDF

Find By Topic