Abstract
With the widespread application of location-based service (LBS) technology in the urban Internet of Things, urban transportation has become a research hotspot. One key issue of urban transportation is the nearest neighbor search of moving objects along a road network. The fast-updating operations of moving objects along a road network suppress the query response time of urban services. Thus, a tree-indexed searching method is proposed to quickly find the answers to user-defined queries on frequently updating road networks. First, a novel index structure, called the double tree-hash index, is designed to reorganize the corresponding relationships of moving objects and road networks. Second, an index-enhanced search algorithm is proposed to quickly find the k -nearest neighbors of moving objects along the road network. Finally, an experiment shows that compared with state-of-the-art algorithms, our algorithm shows a significant improvement in search efficiency on frequently updating road networks.
Highlights
The rapid development of mobile communication and spatial positioning technology has extensively promoted the rise of location-based services (LBS)
The double tree-hash (DTH) index builds a weak bridge between tree and hash structures
This paper focuses on quickly performing the k-NN search of moving objects on a road network environment and using the division strategy to improve the tree-mapping index
Summary
The rapid development of mobile communication and spatial positioning technology has extensively promoted the rise of location-based services (LBS). A state-of-the-art work is the tree-decomposed k -NN search algorithm [18], which contains a tree-based decomposition strategy to establish the one-to-one relationship between each vertex and tree node This method can quickly calculate the shortest distance between any two nodes; it needs to recalculate for updated inputs of k, resulting in increased time consumption thanks to redundant calculations. We propose an index-enhanced search algorithm for the k-NN query problem of moving objects in a road network. The DTH index can realize the continuous updating-dynamic of moving objects in the road network (2) An index-enhanced k-NN search algorithm is proposed to quickly find the k-nearest neighbors of moving objects on the road network.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
