Issue No. 05 - May (2014 vol. 26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.95
Mitzi McCarthy , Dept. of Comput. Sci. & Comput. Eng., La Trobe Univ., Bundoora, VIC, Australia
Zhen He , Dept. of Comput. Sci. & Comput. Eng., La Trobe Univ., Bundoora, VIC, Australia
X. Sean Wang , Sch. of Comput. Sci., Fudan Univ., Shanghai, China
A well-studied query type on moving objects is the continuous range query. An interesting and practical situation is that instead of being continuously evaluated, the query may be evaluated at different degrees of continuity, e.g. every 2 seconds (close to continuous), every 10 minutes or at irregular time intervals (close to snapshot). Furthermore, the range query may be stacked under predicates applied to the returned objects. An example is the count predicate that requires the number of objects in the range to be at least Y. The conjecture is that these two practical considerations can help reduce communication costs. We propose a safe region-based solution that exploits these two practical considerations. An extensive experimental study shows that our solution can reduce communication costs by a factor of 9.5 compared to an existing state-of-the-art system.
query processing, cost reduction
M. McCarthy, Zhen He and X. S. Wang, "Evaluation of Range Queries With Predicates on Moving Objects," in IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. 5, pp. 1144-1157, 2014.