An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs
Summary: GraSorw is an I/O-efficient disk-based graph system for scalable second-order random walks on large graphs. Key innovations: bi-block engine turning random I/Os into sequential I/Os, bucket-based walk management, skewed-walk storage, and a learning-based block loader. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hongzheng Li (Beijing Institute of Technology)
- 2. Yingxia Shao (Beijing Institute of Technology)
- 3. Junping Du (Beijing Institute of Technology)
- 4. Bin Cui (Peking University)
- 5. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{li_vldb22,
title = {{An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs}},
author = {Li, Hongzheng and Shao, Yingxia and Du, Junping and Cui, Bin and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {8},
pages = {1619--1631},
doi = {10.14778/3529337.3529346},
url = {https://doi.org/10.14778/3529337.3529346},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,760 | Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment | 2024 | SIGMOD | 9.8157819e-05 |
| 4,878 | NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams | 2024 | VLDB | 6.4684388e-05 |
| 8,896 | Aster: Enhancing LSM-structures for Scalable Graph Database | 2025 | SIGMOD | 5.3495662e-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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 20 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00056944564 |
| 5,002 | Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures | 2017 | VLDB | 6.4066378e-05 |
| 6,003 | ThunderRW: An In-Memory Graph Random Walk Engine | 2021 | VLDB | 6.0130964e-05 |
| 6,423 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD | 5.8813146e-05 |
| 8,054 | Approximating Aggregate Queries about Web Pages via Random Walks | 2000 | VLDB | 5.4990328e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,951 | READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank | 2017 | VLDB |
| 2 | 10,972 | GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing | 2025 | VLDB |
| 3 | 4,216 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB |
| 4 | 9,424 | Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing | 2016 | SIGMOD |
| 5 | 6,003 | ThunderRW: An In-Memory Graph Random Walk Engine | 2021 | VLDB |
| 6 | 7,255 | Space-Efficient Random Walks on Streaming Graphs | 2023 | VLDB |
| 7 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 8 | 11,228 | FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework | 2024 | VLDB |
| 9 | 7,900 | Distributed Graph Embedding with Information-Oriented Random Walks | 2023 | VLDB |
| 10 | 6,423 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD |