28 citations · 77 across the 28 of their papers we have counts for
6 papers · 1 filter
High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks
Xinjie Zhou, Mengxuan Zhang, Lei Li +1
Shortest path (SP) computation is the building block for many location-based services, and achieving high throughput SP query processing with real-time response is crucial for thos…
A Universal Scheme for Dynamic Partitioned Shortest Path Index: Survey, Improvement, and Experiments
Mengxuan Zhang, Xinjie Zhou, Lei Li +4
Shortest Path (SP) computation is a fundamental operation in many real-life applications such as navigation on road networks, link analysis on social networks, etc. These networks…
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries
Bolong Zheng, Lianggui Weng, Xi Zhao +3
Trajectory similarity computation is a fundamental component in a variety of real-world applications, such as ridesharing, road planning, and transportation optimization. Recent ad…
Updates-Aware Graph Pattern based Node Matching
Guohao Sun, Guanfeng Liu, Yan Wang +1
Graph Pattern based Node Matching (GPNM) is to find all the matches of the nodes in a data graph GD based on a given pattern graph GP. GPNM has become increasingly important in man…
A Survey on Map-Matching Algorithms
Pingfu Chao, Yehong Xu, Wen Hua +1
The map-matching is an essential preprocessing step for most of the trajectory-based applications. Although it has been an active topic for more than two decades and, driven by the…
Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks
Mengxuan Zhang, Lei Li, Wen Hua +1
Finding the shortest paths in road network is an important query in our life nowadays, and various index structures are constructed to speed up the query answering. However, these…