Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs-Reference-Cited by-同舟云学术

Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs

Published:2020-06-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data
language:
Short-container-title:

Author:

Shao Yingxia¹,Huang Shiyue²,Miao Xupeng²,Cui Bin²,Chen Lei³

Affiliation:

1. Beijing Univeristy of Posts and Telecommunications, Beijing, China

2. Peking University, Beijing, China

3. Hong Kong University of Science and Technology, Beijing, China

Funder

National Key R&D Program of China

National Natural Science Foundation of China

Hong Kong RGC GRF Project

Publisher

ACM

Link

Reference44 articles.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. TEA: A General-Purpose Temporal Graph Random Walk Engine;Proceedings of the Eighteenth European Conference on Computer Systems;2023-05-08

3. NosWalker: A Decoupled Architecture for Out-of-Core Random Walk Processing;Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3;2023-03-25

4. Scalable Graph Sampling on GPUs with Compressed Graph;Proceedings of the 31st ACM International Conference on Information & Knowledge Management;2022-10-17