Distributed Transitive Closure Computations: The Disconnection Set Approach
Summary: Disconnection set approach enables distributed transitive closure via domain-fragmented subqueries for connectivity, shortest path, and BOM. Algebraic, update-friendly computation yields near-linear speedups on multi-processor deployments and generalizes to other domains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,865 | Diagnosis of Asynchronous Discrete Event Systems: Datalog to the Rescue! | 2005 | PODS | 0.00010275334 |
| 2,131 | Incremental Evaluation of Rules and its Relationship to Parallelism | 1991 | SIGMOD | 9.4776341e-05 |
| 3,108 | Parallelism in a Main-Memory DBMS: The performance of PRISMA/DB | 1992 | VLDB | 7.5501593e-05 |
| 12,478 | Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing | 2007 | VLDB | 4.1945683e-05 |
| 12,871 | Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB | 1993 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next