HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Conceptual partitioning : an efficient method for continuous nearest neighbor monitoring
Authors: Mouratidis, Kyriakos
Hadjieleftheriou, Marios
Papadias, Dimitris
Keywords: Nearest neighbor
Multiple continuous queries
Conceptual partitioning
Spatial database
Issue Date: Jun-2005
Citation: 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, June 13-16, 2005, p. 634-645
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).
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
SIGMOD05CPM.pdfpre-published version404KbAdobe PDFView/Open

Find published version via OpenURL Link Resolver

All items in this Repository are protected by copyright, with all rights reserved.