  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 indexes can hardly work in real-life scenario because
the traffic condition changes dynamically, which makes the pathfinding slower
than in the static environment. In order to speed up path query answering in
the dynamic road network, we propose a framework to support these indexes.
Firstly, we view the dynamic graph as a series of static snapshots. After that,
we propose two kinds of methods to select the typical snapshots. The first kind
is time-based and it only considers the temporal information. The second
category is the graph representation-based, which considers more insights:
edge-based that captures the road continuity, and vertex-based that reflects
the region traffic fluctuation. Finally, we propose the snapshot matching to
find the most similar typical snapshot for the current traffic condition and
use its index to answer the query directly. Extensive experiments on real-life
road network and traffic conditions validate the effectiveness of our approach.
