Blocking for External Graph Searching (Extended Abstract)
Summary: Disk-blocking model for external-memory graph search that permits vertex replication to exploit redundancy and optimize block-use. Matching upper/lower bounds for complete d-ary trees and d-dimensional grids and near-regular graphs; isothetic-hypercube blocking yields provable speed-up with small redundancy. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,013 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS | 5.7598528e-05 |
| 5,196 | Clustering Techniques for Minimizing External Path Length | 1996 | VLDB | 5.6365164e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,389 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 0.00012260807 |
Previous
Page 1 / 1
Next