Next Article in Journal
Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks
Next Article in Special Issue
An Exploratory Study Investigating Gender Effects on Using 3D Maps for Spatial Orientation in Wayfinding
Previous Article in Journal / Special Issue
Interest Aware Location-Based Recommender System Using Geo-Tagged Social Media
Article

A Line Graph-Based Continuous Range Query Method for Moving Objects in Networks

by 1,2, 1,2,3,* and 1
1
State Key Lab of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing 100101, China
2
Fujian Collaborative Innovation Center for Big Data Applications in Governments, Fuzhou 350003, China
3
Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application, Nanjing 210023, China
*
Author to whom correspondence should be addressed.
Academic Editors: Georg Gartner, Haosheng Huang and Wolfgang Kainz
ISPRS Int. J. Geo-Inf. 2016, 5(12), 246; https://doi.org/10.3390/ijgi5120246
Received: 31 May 2016 / Revised: 4 December 2016 / Accepted: 13 December 2016 / Published: 19 December 2016
(This article belongs to the Special Issue Location-Based Services)
The rapid growth of location-based services has motivated the development of continuous range queries in networks. Existing query algorithms usually adopt an expansion tree to reuse the previous query results to get better efficiency. However, the high maintenance costs of the traditional expansion tree lead to a sharp efficiency decrease. In this paper, we propose a line graph-based continuous range (LGCR) query algorithm for moving objects in networks, which is characterized by a novel graph-based expansion tree (GET) structure used to monitor queries in an incremental manner. In particular, GET is developed based on the line graph model of networks and simultaneously supports offline pre-computation to better adapt our proposed algorithm to different sizes of networks. To improve performance, we create a series of related data structures, such as bridgeable edges and distance edges. Correspondingly, we develop several algorithms, including initialization, insertion of objects, filter and refinement and location update, to incrementally re-evaluate continuous range queries. Finally, we implement the GET and related algorithms in the native graph database Neo4J. We conduct experiments using real-world networks and simulated moving objects and compare the proposed LGCR with the existing classical algorithm to verify its effectiveness and demonstrate its greater efficiency. View Full-Text
Keywords: moving objects; continuous range queries; network; expansion tree moving objects; continuous range queries; network; expansion tree
Show Figures

Figure 1

MDPI and ACS Style

Zhang, H.; Lu, F.; Chen, J. A Line Graph-Based Continuous Range Query Method for Moving Objects in Networks. ISPRS Int. J. Geo-Inf. 2016, 5, 246. https://doi.org/10.3390/ijgi5120246

AMA Style

Zhang H, Lu F, Chen J. A Line Graph-Based Continuous Range Query Method for Moving Objects in Networks. ISPRS International Journal of Geo-Information. 2016; 5(12):246. https://doi.org/10.3390/ijgi5120246

Chicago/Turabian Style

Zhang, Hengcai, Feng Lu, and Jie Chen. 2016. "A Line Graph-Based Continuous Range Query Method for Moving Objects in Networks" ISPRS International Journal of Geo-Information 5, no. 12: 246. https://doi.org/10.3390/ijgi5120246

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop