Issue No.07 - July (2011 vol.23)
Haojun Wang , University of Southern California, Los Angeles
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.171
With the proliferation of mobile devices, an increasing number of urban users subscribe to location-based services. This trend has led to significant research interest in techniques that address two fundamental requirements: road network-based distance computation and the capability to process moving objects as points of interests. However, there exist few techniques that support both requirements simultaneously. To address these challenges, we propose a novel approach to process continuous range queries. We build on our previous work of an infrastructure that supports location-based snapshot queries on MOVing objects in road Networks (MOVNet). We introduce several significant features to enable continuous queries. The dual index structure that we proposed for MOVNet has been appropriately modified. We further appoint a number of connecting vertices in each cell and precompute the distances among them to expedite query processing. Most importantly, to alleviate the effects of frequent object updates, we introduce a Shortest-Distance-based Tree (SD-Tree). We illustrate that the network connectivity and distance information can be preserved and reused by the SD-Tree when the query point location is updated; hence, reducing the continuous query update cost. Our experimental results demonstrate that our method yields excellent performance with a very large number of moving objects.
Spatial databases and GIS, location-dependent and sensitive.
Haojun Wang, "Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 7, pp. 1065-1078, July 2011, doi:10.1109/TKDE.2010.171