Partition-based lazy updates for continuous queries over moving objects

  • Authors:

  • Yu-Ling Hsueh;Roger Zimmermann;Haojun Wang;Wei-Shinn Ku

  • Affiliations:

  • University of Southern California, Los Angeles, CA;National University of Singapore, Singapore;University of Southern California, Los Angeles, CA;Auburn University, Auburn, AL

  • Venue:
  • Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data objects are dynamic, making it very challenging to find an efficient query evaluation strategy. The significant overhead related to frequent location updates from moving objects often results in poor performance. The most advanced existing techniques use the concept of simple geometric safe regions to delay or avoid location updates. We introduce a Partition-based Lazy Update (PLU) algorithm that elevates this idea further by adopting Location Information Tables (LIT) which (a) allow each moving object to estimate possible query movements and issue a location update only when it may affect any query results and (b) enable smart server probing that results in fewer messages. Among the significant advantages, our technique performs well even in very highly dynamic environments (with up to 100% mobility) where many other techniques deteriorate. PLU can be efficiently implemented and we demonstrate its query performance improvement of up to 28% over the current state-of-the-art.