Database Paper Browser

Back to papers

An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network

Summary: Defines a complete DSP space by determinant/constraint dimensions and benchmarks state-of-the-art methods under synthetic network setup. Introduces dynamic degree to classify environments and uses throughput as a guideline metric, validated on real networks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12392
Venue
VLDB
Year
2021
Pagerank
5.0368875e-05
Overall Rank
6,491 | 54.89%
DOI
10.14778/3476249.3476267

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 22 of 22 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
260 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00030020929
377 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00025074538
434 Scalable Network Distance Browsing in Spatial Databases 2008 SIGMOD 0.00023277433
946 Path Oracles for Spatial Networks 2009 VLDB 0.00015117675
1,173 Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation 2012 VLDB 0.00013501079
1,385 A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs 2012 SIGMOD 0.00012259478
1,653 An Experimental Study on Hub Labeling based Shortest Path Algorithms 2018 VLDB 0.0001098717
1,694 Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice 2013 SIGMOD 0.00010870205
1,822 Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks 2014 VLDB 0.00010404349
1,843 IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying 2013 VLDB 0.00010340277
1,893 Querying Shortest Paths on Time Dependent Road Networks 2019 VLDB 0.00010175836
2,206 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 9.2958349e-05
2,388 Anytime Stochastic Routing with Hybrid Learning 2020 VLDB 8.9047008e-05
2,547 Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees 2020 VLDB 8.5600506e-05
2,643 Scaling Distance Labeling on Small-World Networks 2019 SIGMOD 8.3894193e-05
3,171 Minimal On-Road Time Route Scheduling on Time-Dependent Graphs 2017 VLDB 7.4471807e-05
4,136 Effective Caching of Shortest Paths for Location-Based Services 2012 SIGMOD 6.4131651e-05
4,536 Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020 VLDB 6.099154e-05
4,542 Distributed Processing of k Shortest Path Queries over Dynamic Road Networks 2020 SIGMOD 6.0960736e-05
5,255 Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks 2020 SIGMOD 5.5991117e-05
7,240 Toward a Distance Oracle for Billion-Node Graphs 2014 VLDB 4.7869144e-05
8,973 Planting Trees for scalable and efficient Canonical Hub Labeling 2020 VLDB 4.4148296e-05
Previous Page 1 / 1 Next

Semantically Similar Papers