An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance

Authors:
Ken C. K. Lee;Hong Va Leong;Jing Zhou;Antonio Si
Affiliations:
The Hong Kong Polytechnic University, Hong Kong;The Hong Kong Polytechnic University, Hong Kong;The Hong Kong Polytechnic University, Hong Kong;Oracle Corporation, Redwood Shores, CA
Venue:
Proceedings of the 6th international conference on Mobile data management
Year:
2005

Citing 9
Cited 7

Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On moving object queries: (extended abstract)

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Time-parameterized queries in spatio-temporal databases

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Fast Nearest-Neighbor Query Processing in Moving-Object Databases

Geoinformatica
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Round-Eye: A system for tracking nearest surrounders in moving object environments

Journal of Systems and Software
Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity

Geoinformatica
Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity

Geoinformatica
Scalable processing of continuous K-nearest neighbor queries with uncertain velocity

Expert Systems with Applications: An International Journal
Vague continuous K-nearest neighbor queries over moving objects with uncertain velocity in road networks

Information Systems
Panda: a predictive spatio-temporal query processor

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Predictive spatio-temporal queries: a comprehensive survey and future directions

Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

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.