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,872 | Diagnosis of Asynchronous Discrete Event Systems: Datalog to the Rescue! | 2005 | PODS | 0.00010255586 |
| 2,134 | Incremental Evaluation of Rules and its Relationship to Parallelism | 1991 | SIGMOD | 9.4690121e-05 |
| 3,113 | Parallelism in a Main-Memory DBMS: The performance of PRISMA/DB | 1992 | VLDB | 7.5433318e-05 |
| 12,487 | Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing | 2007 | VLDB | 4.1905499e-05 |
| 12,881 | Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB | 1993 | VLDB | 4.1905499e-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