Please use this identifier to cite or link to this item:
|Title:||Partition-based lazy updates for continuous queries over moving objects|
|Keywords:||mobile computing and location-based services|
|Source:||Hsueh, Y.-L.,Zimmermann, R.,Wang, H.,Ku, W.-S. (2007). Partition-based lazy updates for continuous queries over moving objects. GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems : 284-291. ScholarBank@NUS Repository. https://doi.org/10.1145/1341012.1341060|
|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. © 2007 ACM.|
|Source Title:||GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.