Junjie Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Junjie Zhou has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Guoren Wang
Beijing Institute of Technology, Beijing, China
2 shared publications - Meihao Liao
Beijing Institute of Technology, Beijing, China
2 shared publications - Rong-Hua Li
Beijing Institute of Technology, Beijing, China
2 shared publications - Hongyang Chen
Zhejiang Lab
1 shared publication - Longlong Lin
College of Computer and Information Science, Southwest University, Chongqing, China
1 shared publication - Qiangqiang Dai
Beijing Institute of Technology, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 22 September 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (4) , 1-26
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor
Personalized PageRank (PPR) is a fundamental graph proximity measure with a wide range of applications. The single-source Personalized PageRank (SSPPR) query aims to compute the PPR values for all nodes from a given source node. Due to the high computational cost of exact SSPPR computation, most existing solutions focus on approximate queries with accuracy guarantees. The state-of-the-art approaches for approximate SSPPR queries are index-based and are typically designed for a single, fixed value of α. However, real-world applications often require handling multiple values of α, and current index-based methods struggle to adapt to varying values of α without rebuilding the index. To address this limitation, we propose a novel and efficient index approach for SSPPR queries that supports all values of α. A striking feature of our approach is that it stores only a single index for all possible values of α. This is achieved by leveraging the loop-erased α-random walk interpretation of PPR and constructing a stack-style meta-index with a sufficiently large damping factor ā, denoted as StackIndex. Then, we develop a novel technique to efficiently transform StackIndex into a new index for any specified damping factor α, without the need to rebuild the index. We show that our index construction algorithm requires around O (ω n ) time and O (ω n ) space to ensure approximation quality, where ω and n represent the sample size and the number of nodes in the graph, respectively. We also develop an index maintenance technique to update our StackIndex when handling dynamic graphs with edge insertions and deletions. Extensive experiments on 5 large real-world graphs demonstrate that StackIndex offers substantial speedups over previous index-based methods for PPR queries with different α while maintaining the same accuracy guarantee.
- 22 September 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (4) , 1-26
Open AccessOne Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor
Personalized PageRank (PPR) is a fundamental graph proximity measure with a wide range of applications. The single-source Personalized PageRank (SSPPR) query aims to compute the PPR values for all nodes from a given source node. Due to the high computational cost of exact SSPPR computation, most existing solutions focus on approximate queries with accuracy guarantees. The state-of-the-art approaches for approximate SSPPR queries are index-based and are typically designed for a single, fixed value of α. However, real-world applications often require handling multiple values of α, and current index-based methods struggle to adapt to varying values of α without rebuilding the index. To address this limitation, we propose a novel and efficient index approach for SSPPR queries that supports all values of α. A striking feature of our approach is that it stores only a single index for all possible values of α. This is achieved by leveraging the loop-erased α-random walk interpretation of PPR and constructing a stack-style meta-index with a sufficiently large damping factor ā, denoted as StackIndex. Then, we develop a novel technique to efficiently transform StackIndex into a new index for any specified damping factor α, without the need to rebuild the index. We show that our index construction algorithm requires around O (ω n ) time and O (ω n ) space to ensure approximation quality, where ω and n represent the sample size and the number of nodes in the graph, respectively. We also develop an index maintenance technique to update our StackIndex when handling dynamic graphs with edge insertions and deletions. Extensive experiments on 5 large real-world graphs demonstrate that StackIndex offers substantial speedups over previous index-based methods for PPR queries with different α while maintaining the same accuracy guarantee.
- Open Access
- 29 May 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (3) , 1-27
Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach
Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph, and it finds applications in various domains including graph clustering, recommendation systems, link prediction, and graph neural networks. The state-of-the-art algorithm for computing effective resistance relies on a landmark technique, which involves selecting a node that is easy to reach by all the other nodes as a landmark. The performance of this technique heavily depends on the chosen landmark node. However, in many real-life graphs, it is not always possible to find an easily reachable landmark node, which can significantly hinder the algorithm's efficiency. To overcome this problem, we propose a novel multiple landmarks technique which involves selecting a set of landmark nodes V l such that the other nodes in the graph can easily reach any one of a landmark node in V l . Specifically, we first propose several new formulas to compute ER with multiple landmarks, utilizing the concept of Schur complement. These new formulas allow us to pre-compute and maintain several small-sized matrices related to V l as a compact index. With this powerful index technique, we demonstrate that both single-pair and single-source ER queries can be efficiently answered using a newly-developed V l -absorbed random walk sampling or V l -absorbed push technique. Comprehensive theoretical analysis shows that all proposed index-based algorithms achieve provable performance guarantees for both single-pair and single-source ER queries. Extensive experiments on 5 real-life datasets demonstrate the high efficiency of our multiple landmarks-based index techniques. For instance, our algorithms, with a 1.5 GB index size, can be up to 4 orders of magnitude faster than the state-of-the-art algorithms while achieving the same accuracy on a large road network.
- 29 May 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (3) , 1-27
Open AccessEfficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach
Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph, and it finds applications in various domains including graph clustering, recommendation systems, link prediction, and graph neural networks. The state-of-the-art algorithm for computing effective resistance relies on a landmark technique, which involves selecting a node that is easy to reach by all the other nodes as a landmark. The performance of this technique heavily depends on the chosen landmark node. However, in many real-life graphs, it is not always possible to find an easily reachable landmark node, which can significantly hinder the algorithm's efficiency. To overcome this problem, we propose a novel multiple landmarks technique which involves selecting a set of landmark nodes V l such that the other nodes in the graph can easily reach any one of a landmark node in V l . Specifically, we first propose several new formulas to compute ER with multiple landmarks, utilizing the concept of Schur complement. These new formulas allow us to pre-compute and maintain several small-sized matrices related to V l as a compact index. With this powerful index technique, we demonstrate that both single-pair and single-source ER queries can be efficiently answered using a newly-developed V l -absorbed random walk sampling or V l -absorbed push technique. Comprehensive theoretical analysis shows that all proposed index-based algorithms achieve provable performance guarantees for both single-pair and single-source ER queries. Extensive experiments on 5 real-life datasets demonstrate the high efficiency of our multiple landmarks-based index techniques. For instance, our algorithms, with a 1.5 GB index size, can be up to 4 orders of magnitude faster than the state-of-the-art algorithms while achieving the same accuracy on a large road network.