Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/39890
Title: An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance
Authors: Lee, KCK
Leong, HV 
Zhou, J
Si, A
Keywords: Continuous query
Location management
Mobile computing
Nearest neighbor
Predictive query processing
Query processing
Issue Date: 2005
Source: MDM '05 Proceedings of the 6th International Conference on Mobile Data Management, Ayia Napa, Cyprus, May 9-13, 2005, p. 178-182 How to cite?
Abstract: Predictive continuous nearest neighbor queries are concerned with finding the nearest neighbor objects for some future time period according to the current object and query locations and their motion information. Existing continuous query processing algorithms are not efficient enough, requiring multiple dataset lookups to evaluate the query results throughout the duration of a continuous query. More importantly, the complete result for the whole query time interval is only available at the moment when all object motion updates have been examined, based on which adjustment of the query result is made. In this paper, we propose an algorithm which requires only one dataset lookup to deliver a complete predictive result. We then apply a differential update technique to maintain the query results incrementally in the presence of object location and motion updates.
URI: http://hdl.handle.net/10397/39890
ISBN: 1-59593-041-8
DOI: 10.1145/1071246.1071273
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

28
Last Week
4
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.