I/O-Efficient Butterfly Counting at Scale

Author:

Wang Zhibin1ORCID,Lai Longbin2ORCID,Liu Yixue1ORCID,Shui Bing1ORCID,Tian Chen1ORCID,Zhong Sheng1ORCID

Affiliation:

1. Nanjing University, Nanjing, China

2. Alibaba Group, Hangzhou, China

Abstract

Butterfly (a cyclic graph motif) counting is a fundamental task with many applications in graph analysis, which aims at computing the number of butterflies in a large graph. With the rapid growth of graph data, it is more and more challenging to do butterfly counting due to the super-linear time complexity and large memory consumption. In this paper, we study I/O-efficient algorithms for doing butterfly counting on hierarchical memory. Existing algorithms of the kind cannot guarantee I/O optimality. Observing that in order to count butterflies, it suffices to "witness" a subgraph instead of the whole structure, a new class of algorithms called semi-witnessing algorithm is proposed. We prove that a semi-witnessing algorithm is not restricted by the lower bound Ømega(|E|2/MB) of a witnessing algorithm, and give a new bound of Ømega(min(|E|2/MB, |E|/|V| √M B)). We further develop the IOBufs algorithm that manages to approach the I/O lower bound, and thus claim its optimality. Finally, we make efforts to parallelize IOBufs to further improve the performance and scalability. We show in the experiment that IOBufs significantly outperforms the state-of-the-art algorithms EMRC and BFC-EM. In addition, IOBufs can scale to conducting butterfly counting on the Clueweb graph with 37 billion edges and quintillions (10^18 ) of butterflies.

Funder

Leading-edge Technology Program of Jiangsu NSF

NSFC

National Key R&D Program of China

Publisher

Association for Computing Machinery (ACM)

Reference66 articles.

1. Measuring and modeling bipartite graphs with community structure

2. Khaled Ammar , Frank McSherry , Semih Salihoglu , and Manas Joglekar . 2018. Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows. arXiv preprint arXiv:1802.03760 ( 2018 ). Khaled Ammar, Frank McSherry, Semih Salihoglu, and Manas Joglekar. 2018. Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows. arXiv preprint arXiv:1802.03760 (2018).

3. CECI

4. Efficient Subgraph Matching by Postponing Cartesian Products

5. Paolo Boldi Andrea Marino Massimo Santini and Sebastiano Vigna. 2014. BUbiNG: Massive Crawling for the Masses. In WWW. 227--228. Paolo Boldi Andrea Marino Massimo Santini and Sebastiano Vigna. 2014. BUbiNG: Massive Crawling for the Masses. In WWW. 227--228.

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

1. Butterfly Counting over Bipartite Graphs with Local Differential Privacy;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3