Performance Guarantees for Distributed Reachability Queries
Summary: Distributed evaluation of reachability, bounded reachability, and regular reachability on fragmented graphs via partial evaluation for parallelism. Guarantees: each site visited once; traffic depends on query size and fragmentation, not graph size; latency set by largest fragment; MapReduce-ready. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Harbin Engineering University; University of Edinburgh)
- 2. Xin Wang (University of Edinburgh)
- 3. Yinghui Wu (University of California Santa Barbara; University of Edinburgh)
BibTeX Citation
@article{fan_vldb12,
title = {{Performance Guarantees for Distributed Reachability Queries}},
author = {Fan, Wenfei and Wang, Xin and Wu, Yinghui},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {11},
pages = {1304--1315},
doi = {10.14778/2350229.2350248},
url = {https://doi.org/10.14778/2350229.2350248},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,357 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 7.3652047e-05 |
| 4,805 | Distributed Processing of k Shortest Path Queries over Dynamic Road Networks | 2020 | SIGMOD | 6.3917568e-05 |
| 5,968 | Distributed Graph Simulation: Impossibility and Possibility | 2014 | VLDB | 5.9135528e-05 |
| 7,020 | RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing | 2024 | VLDB | 5.6038946e-05 |
| 8,816 | Distributed Set Reachability | 2016 | SIGMOD | 5.2567916e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012089097 |
| 47 | PNUTS: Yahoo!'s Hosted Data Serving Platform | 2008 | VLDB | 0.00043937456 |
| 1,592 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.0001010713 |
| 5,480 | Distributed Query Evaluation with Performance Guarantees | 2007 | SIGMOD | 6.0991082e-05 |
| 5,604 | Using Partial Evaluation in Distributed Query Evaluation | 2006 | VLDB | 6.0512827e-05 |
| 7,556 | Querying and Monitoring Distributed Business Processes | 2008 | VLDB | 5.4796165e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,847 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 2 | 5,480 | Distributed Query Evaluation with Performance Guarantees | 2007 | SIGMOD |
| 3 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 4 | 1,857 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 5 | 3,167 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |
| 6 | 10,635 | DRPQ: Distributed Evaluation of Regular Path Queries On Streaming Graphs | 2026 | SIGMOD |
| 7 | 4,568 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 8 | 1,253 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 9 | 5,968 | Distributed Graph Simulation: Impossibility and Possibility | 2014 | VLDB |
| 10 | 8,816 | Distributed Set Reachability | 2016 | SIGMOD |