Database Paper Browser

Back to papers

Indexed Fast Network Proximity Querying

Summary: I-Chopper: scalable index for random-walk proximity on billion-node graphs, marrying graph-partitioning with fast iterative Chebyshev-based processing. Hybrid inversion-like speed with compact storage improves convergence, reduces index size for top-k proximity queries on real networks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11788
Venue
VLDB
Year
2018
Pagerank
4.9041884e-05
Overall Rank
6,865 | 52.25%
DOI
10.14778/3204028.3204029

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
7,086 Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach 2022 SIGMOD 4.8381004e-05
9,245 Efficient Resistance Distance Computation: the Power of Landmark-based Approaches 2023 SIGMOD 4.3690661e-05
9,325 Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches 2023 SIGMOD 4.3556432e-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
486 Fast Incremental and Personalized PageRank 2011 VLDB 0.00022068545
768 PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks 2011 VLDB 0.00016919065
1,641 Fast and Exact Top-k Search for Random Walk with Restart 2012 VLDB 0.00011047924
1,920 Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs 2014 SIGMOD 0.00010090791
2,098 Efficient Ad-hoc Search for Personalized PageRank 2013 SIGMOD 9.5480012e-05
2,210 BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs 2015 SIGMOD 9.2856573e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
1,823 Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks 2014 VLDB 0.00010413508
4,527 On the Embeddability of Random Walk Distances 2013 VLDB 6.1083926e-05
10,165 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 4.1945683e-05
1,920 Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs 2014 SIGMOD 0.00010090791
6,080 Answering Top-k Representative Queries on Graph Databases 2014 SIGMOD 5.2214553e-05
334 Fast and Practical Indexing and Querying of Very Large Graphs 2007 SIGMOD 0.00027081079
5,946 Reverse Top-k Search using Random Walk with Restart 2014 VLDB 5.2616887e-05
10,957 Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach 2024 SIGMOD 4.1945683e-05
506 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021475362
4,067 Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach 2012 SIGMOD 6.4795399e-05