On Monitoring the top-k Unsafe Places

Authors:
Donghui Zhang;Yang Du;Ling Hu
Affiliations:
College of Computer and Information Science, Northeastern University. donghui@ccs.neu.edu;College of Computer and Information Science, Northeastern University. duy@ccs.neu.edu;College of Computer and Information Science, Northeastern University. audnyhu@ccs.neu.edu
Venue:
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Year:
2008

Citing 0
Cited 5

On continuously monitoring the top-k moving objects with relational group and score functions

SIGSPATIAL Special
On continuous monitoring top-k unsafe moving objects

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Subject-oriented top-k hot region queries in spatial dataset

Proceedings of the 20th ACM international conference on Information and knowledge management
Towards integrating real-world spatiotemporal data with social networks

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
GEOSO - a geo-social model: from real-world co-occurrences to social connections

DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a city, protecting units like police cars move around and protect places such as banks and residential buildings. Different places may have different requirements in how many protecting units should be nearby. If any place has less protecting units around than it requires, it is an unsafe place. This paper studies the Continuous Top-k Unsafe Places (CTUP) query, which continuously monitors the k least safe places while the protecting units keep sending their location updates to the server. The CTUP query is a novel addition to the family of continuous location-based queries, an emerging area due to the recent advances in dynamic location-aware environments. Solutions to existing continuous location-based queries and to the traditional top-k queries do not apply. This paper proposes two solutions to this new query, the BasicCTUP scheme and the OptCTUP scheme. Experiments are conducted to evaluate the proposed solutions.