Scalable processing of spatial alarms

  • Authors:
  • Bhuvan Bamba;Ling Liu;Philip S. Yu;Gong Zhang;Myungcheol Doo

  • Affiliations:
  • College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;Department of Computer Science, University of Illinois at Chicago;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology

  • Venue:
  • HiPC'08 Proceedings of the 15th international conference on High performance computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spatial alarms can be modeled as location-based triggerswhich are fired whenever the subscriber enters the spatial region aroundthe location of interest associated with the alarm. Alarm processing requiresmeeting two demanding objectives: high accuracy, which ensureszero or very low alarm misses, and system scalability, which requireshighly efficient processing of spatial alarms. Existing techniques like periodicevaluation or continuous query-based approach, when applied tothe spatial alarm processing problem, lead to unpredictable inaccuracyin alarm processing or unnecessarily high computational costs or both.In order to deal with these weaknesses, we introduce the concept ofsafe period to minimize the number of unnecessary spatial alarm evaluations,increasing the throughput and scalability of the server. Further,we develop alarm grouping techniques based on locality of the alarmsand motion behavior of the mobile users, which reduce safe period computationcosts at the server side. An evaluation of the scalability andaccuracy of our approach using a road network simulator shows that theproposed approach offers significant performance enhancements for thealarm processing server.