On continuous monitoring top-k unsafe moving objects

Authors:
Jian Wen;Vassilis J. Tsotras
Affiliations:
University of California, Riverside, Riverside, CA;University of California, Riverside, Riverside, CA
Venue:
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Year:
2010

Citing 4
Cited 0

Combining fuzzy information from multiple systems (extended abstract)

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Framework for Generating Network-Based Moving Objects

Geoinformatica
Optimal aggregation algorithms for middleware

Journal of Computer and System Sciences - Special issu on PODS 2001
On Monitoring the top-k Unsafe Places

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the wide usage of location tracking systems, continuously tracking relationships among moving objects over their location changes is possible and important to many real applications. This paper proposes a novel continuous location-based query, called the continuous top-k unsafe moving objects query or CTUO. This query continuously monitors the k most unsafe moving objects, where the unsafety of an object (protectee) is defined by the difference between its safety requirement and the protection provided by protection forces (protectors) around it. Compared with the traditional top-k queries where the score of an object represents its own characteristics, CTUO describes the relationships between protectees and protectors, which introduces computational challenges since naively all objects should be inspected to answer such a query. To avoid this, two efficient algorithms, GridPrune and GridPrune-Pro, are proposed based on the basic pruning technology from the Threshold Algorithm. Experiments show that the proposed algorithms outperform the naive solution with nearly two orders of magnitude on I/O savings.