Indexed Fast Network Proximity Querying
Summary: I-Chopper indexes random-walk proximity using graph partitioning and Chebyshev-polynomial iteration over the complex elliptic plane. It achieves inversion-like query speed with iterative-method storage, scaling top-k queries to billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mustafa Coskun (Case Western Reserve University; Hamad Bin Khalifa University; Qatar Computing Research Institute)
- 2. Ananth Grama (Purdue University)
- 3. Mehmet Koyuturk (Case Western Reserve University)
BibTeX Citation
@article{coskun_vldb18,
title = {{Indexed Fast Network Proximity Querying}},
author = {Coskun, Mustafa and Grama, Ananth and Koyuturk, Mehmet},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {8},
pages = {840--852},
doi = {10.14778/3204028.3204029},
url = {https://doi.org/10.14778/3204028.3204029},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,403 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD | 5.7963998e-05 |
| 8,020 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD | 5.4061498e-05 |
| 8,226 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD | 5.3740319e-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 |
|---|---|---|---|---|
| 556 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00016500392 |
| 739 | PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks | 2011 | VLDB | 0.00014333298 |
| 1,419 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB | 0.00010728945 |
| 1,604 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD | 0.00010095949 |
| 1,798 | BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs | 2015 | SIGMOD | 9.616919e-05 |
| 1,860 | Efficient Ad-hoc Search for Personalized PageRank | 2013 | SIGMOD | 9.4876834e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,585 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |
| 2 | 4,649 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 3 | 10,326 | Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search | 2026 | SIGMOD |
| 4 | 1,604 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD |
| 5 | 330 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD |
| 6 | 6,027 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD |
| 7 | 5,914 | Reverse Top-k Search using Random Walk with Restart | 2014 | VLDB |
| 8 | 8,629 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD |
| 9 | 355 | On Graph Query Optimization in Large Networks | 2010 | VLDB |
| 10 | 3,934 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD |