Extending the LBS-framework TraX: Efficient proximity detection with dead reckoning
Computer Communications
Efficient clique detection among mobile targets
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Top-K probabilistic closest pairs query in uncertain spatial databases
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Moving Query Monitoring in Spatial Network Environments
Mobile Networks and Applications
| Hi-index | 0.00 |
k-closest pair query is a useful type of query in many practical applications involving spatial data for decision making. The traditional techniques to handle k-closest pair queries generally assume that the objects are static. In this paper, we study the problem of k-closest pair monitoring (kCPM) over moving objects. Aiming at reducing communication cost for location updates between the clients and the server, our proposed kCPM approach achieves high monitoring accuracy with less CPU utilization compared to existing periodical location update schemes.