Title: Dynamic safe regions for moving range queries in mobile navigation

Authors: Haidar Al-Khalidi; David Taniar; John Betts; Sultan Alamri

Addresses: Clayton School of Information Technology, Monash University, Clayton, Victoria 3800, Australia ' Clayton School of Information Technology, Monash University, Clayton, Victoria 3800, Australia ' Clayton School of Information Technology, Monash University, Clayton, Victoria 3800, Australia ' Clayton School of Information Technology, Monash University, Clayton, Victoria 3800, Australia

Abstract: The cost of monitoring and updating the location of Moving Queries is very high, as the calculation of a range query needs to be re-evaluated whenever the query moves. Previous efforts to reduce this cost have proposed reducing the frequency of communication between query and server. However, because all possible objects continue to be surveyed using these approaches, substantial cost reduction is not possible. This paper introduces two novel techniques: the continuous basic safe region, by calculating the closest objects to the border of the moving query, and the continuous extended safe region, by calculating the intersections among several range objects. Inside these safe regions there is no need to update the query as the set of objects of interest does not change. We compare the size of the safe regions obtained using these two methods and show their potential to greatly reduce computations and communications cost in client-server architectures.

Keywords: safe regions; moving range queries; query processing; mobile navigation; client-server architectures.

DOI: 10.1504/IJAHUC.2014.064860

International Journal of Ad Hoc and Ubiquitous Computing, 2014 Vol.16 No.4, pp.250 - 259

Received: 10 Nov 2012
Accepted: 13 Jun 2013
Published online: 19 Sep 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article