Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

6-2005

Abstract

Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for static datasets, the traditional methods do not extend to highly dynamic environments where multiple continuous queries require real-time results, and both objects and queries receive frequent location updates. In this paper we propose conceptual partitioning (CPM), a comprehensive technique for the efficient monitoring of continuous NN queries. CPM achieves low running time by handling location updates only from objects that fall in the vicinity of some query (and ignoring the rest). It can be used with multiple, static or moving queries, and it does not make any assumptions about the object moving patterns. We analyze the performance of CPM and show that it outperforms the current state-of-the-art algorithms for all problem settings. Finally, we extend our framework to aggregate NN (ANN) queries, which monitor the data objects that minimize the aggregate distance with respect to a set of query points (e.g., the objects with the minimum sum of distances to all query points).

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on management of data

First Page

634

Last Page

645

ISBN

9781595930606

Identifier

10.1145/1066157.1066230

Publisher

ACM

City or Country

Baltimore, MD

Additional URL

http://dx.doi.org/10.1145/1066157.1066230

Download

Share

COinS