A Hierarchical Contraction Scheme for Querying Big Graphs-Reference-Cited by-同舟云学术

A Hierarchical Contraction Scheme for Querying Big Graphs

Published:2022-06-10 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 International Conference on Management of Data
language:
Short-container-title:

Author:

Fan Wenfei¹,Li Yuanhao²,Liu Muyang²,Lu Can³

Affiliation:

1. University of Edinburgh, Shenzhen Institute of Computing Sciences, & Beihang University, Edinburgh, United Kingdom

2. University of Edinburgh, Edinburgh, United Kingdom

3. Shenzhen Institute of Computing Sciences, Shenzhen, China

Funder

EPSRC Centre for Doctoral Training in Pervasive Parallelism

European Research Council

Royal Society Wolfson Research Merit Award

National Natural Science Foundation of China

Publisher

ACM

Link

Reference78 articles.

1. 2006. Traffic. http://www.dis.uniroma1.it/challenge9/download.shtml. 2006. Traffic. http://www.dis.uniroma1.it/challenge9/download.shtml.

2. 2006. UKWeb. http://law.di.unimi.it/webdata/uk-union-2006-06--2007-05/. 2006. UKWeb. http://law.di.unimi.it/webdata/uk-union-2006-06--2007-05/.

3. 2012. Friendster. https://snap.stanford.edu/data/com-Friendster.html. 2012. Friendster. https://snap.stanford.edu/data/com-Friendster.html.

4. 2020 a. GRAPE. https://github.com/alibaba/libgrape-lite.git. 2020 a. GRAPE. https://github.com/alibaba/libgrape-lite.git.

5. 2020 b. GraphScope. https://graphscope.io/. 2020 b. GraphScope. https://graphscope.io/.

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

3. Poligras: Policy-Based Graph Summarization;Proceedings of the VLDB Endowment;2024-06