An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance Ken C. K. Lee, Hong Va Leong, Jing Zhou, and Antonio Si   View Paper (PDF)   Return to Session 6. Mobile queries 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. ©2006 Association for Computing Machinery