Fangliang Wei
Research Subjects
Fangliang Wei has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Guanyu Li
Dalian Maritime University
1 shared publication - Jingmin An
Dalian Neusoft University of Information
1 shared publication - Mei Bai
Northeastern University
1 shared publication - Wei Jiang
Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software Engineering, Dalian University, Dalian 116622, P. R. China
1 shared publication - Yongqiang Ren
College of Information Science and Technology
1 shared publication
Latest Publications
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Tree Index Nearest Neighbor Search of Moving Objects along a Road Network
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.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessTree Index Nearest Neighbor Search of Moving Objects along a Road Network
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.