Database Paper Browser

Back to papers

Distributed Graph Simulation: Impossibility and Possibility

Summary: Impossibility: no distributed graph-simulation algorithm can be parallel scalable in either response time or data shipment on fragmented graphs. Partition-bounded guarantees: runtime depends on |Q|, |F_m|, and crossing vertices |V_f|; data shipment depends on |Q| and crossing edges |E_f|, with the first algorithms achieving these bounds and experimental validation; special scalable cases identified. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10768
Venue
VLDB
Year
2014
Pagerank
5.1857597e-05
Overall Rank
6,146 | 57.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers