Efficient Community Search over Large Directed Graph: An Augmented Index-based Approach

Author:

Chen Yankai1,Zhang Jie2,Fang Yixiang3,Cao Xin3,King Irwin1

Affiliation:

1. Department of Computer Science and Engineering, The Chinese University of Hong Kong

2. School of Computer Science and Engineering, Nanyang Technological University

3. School of Computer Science and Engineering, University of New South Wales

Abstract

Given a graph G and a query vertex q, the topic of community search (CS), aiming to retrieve a dense subgraph of G containing q, has gained much attention. Most existing works focus on undirected graphs which overlooks the rich information carried by the edge directions. Recently, the problem of community search over directed graphs (or CSD problem) has been studied [Fang et al., 2019b]; it finds a connected subgraph containing q, where the in-degree and out-degree of each vertex within the subgraph are at least k and l, respectively. However, existing solutions are inefficient, especially on large graphs. To tackle this issue, in this paper we propose a novel index called D-Forest, which allows a CSD query to be completed within the optimal time cost. We further propose efficient index construction methods. Extensive experiments on six real large graphs show that our index-based query algorithm is up to two orders of magnitude faster than existing solutions.

Publisher

International Joint Conferences on Artificial Intelligence Organization

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

1. Scalable Community Search over Large-scale Graphs based on Graph Transformer;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10

2. A Unified and Scalable Algorithm Framework of User-Defined Temporal (k,X)-Core Query;IEEE Transactions on Knowledge and Data Engineering;2024-07

3. Evolution Forest Index: Towards Optimal Temporal k -Core Component Search via Time-Topology Isomorphic Computation;Proceedings of the VLDB Endowment;2024-07

4. Querying Cohesive Subgraph Regarding Span-Constrained Triangles on Temporal Graphs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. A survey on graph embedding techniques for biomedical data: Methods and applications;Information Fusion;2023-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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