Continuous k-nearest neighbor search under mobile environment
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Optimizing moving queries over moving object data streams
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Answer-pairs and processing of continuous nearest-neighbor queries
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
ER'05 Proceedings of the 24th international conference on Perspectives in Conceptual Modeling
| Hi-index | 0.01 |
The paper describes a new method of continuously monitoringthe k nearest neighbors of a given object in the mobileenvironment.Instead of monitoring all k nearest neighbors,we choose to monitor the k-th (nearest) neighbor sincethe necessary condition of changes in the KNN is the changeof the k-th neighbor.In addition, rather than in the originalspace, we consider the moving objects in a transformedtime-distance (TD) space, where each object is representedby a curve.A beach-line algorithm is developed to monitorthe change of the k-th neighbor, which enables us to maintainthe KNN incrementally.An extensive empirical studyshows that the beach-line algorithm outperforms the mostefficient existing algorithm by a wide margin, especiallywhen k or n (the total number of objects) is large.