Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware
Junchao Ma, Xin Yan, Yuanyuan Zhu, Guojing Li, Hao Zhang, Jeffrey Xu Yu
Abstract
k -truss is one of the most widely used community models where each edge is contained in at least k -2 triangles, and Triangle-connected k -Truss Community ( k -TTC) is a strengthened variant of k -truss that further requires edges to reach each other via a series of adjacent triangles. EquiTree is the state-of-the-art tree-structured index, which is space efficient and can support time-optimal k -TTC search for query vertices. However, for large graphs with billions of edges, the sequential algorithm still needs seconds to conduct k -TTC search and hours to construct the index due to the costly triangle connectivity examination. In this paper, we study how to accelerate k -TTC search by hardware accelerators. Specifically, we propose a tensor-based framework, including index construction, online search, and index maintenance, which can be efficiently deployed and run on heterogeneous hardware. To accelerate index construction, we first propose an iterative basic algorithm which creates and refines supernodes and superedges based on each k -class layer by layer. To further boost the parallelism, we propose a triangle-based supernode and superedge creation strategy, which categorizes triangles into three types ( internal, marginal, external ), and applies tailored operations for each type to enable batch processing instead of iterative steps. Meanwhile, we propose the batch-based merging strategy to refine the index into a tree structure. We also propose tensor-based algorithms for online k -TTC search and index maintenance. Extensive experiments show that our tensor-based algorithms achieve an average speedup of two orders of magnitude over state-of-the-art methods in both index construction and community search, while efficiently maintaining indices for dynamic graphs. Moreover, we validated that our tensor-based algorithms can be smoothly deployed and run on heterogeneous hardware accelerators (NVIDIA GPUs and AMD GPUs) for acceleration.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 533f01d0-5ca0-46e5-ac02-50e4ce3a0123Related papers
- Efficient Triangle-Connected Truss Community Search In Dynamic GraphsTianyang Xu, Zhao Lu, Yuanyuan ZhuVLDB 2023 · 23 citations
- TDT: Tensor Based Directed Truss DecompositionGuojing Li, Yuanyuan Zhu, Junchao Ma, Ming Zhong et al.ICDE 2025 · 1 citation
- Accelerating Truss Decomposition on Heterogeneous ProcessorsYulin Che, Zhuohang Lai, Shixuan Sun, Yue Wang et al.VLDB 2020 · 46 citations
- Efficient Community Search Based on Relaxed k-Truss IndexXiaoqin Xie, Shuangyuan Liu, Jiaqi Zhang, Shuai Han et al.SIGIR 2024 · 4 citations
- With Anchors or Not: Fairness-Aware Truss-Based Community Search on Attributed GraphsXinrui Wang, Zilong Liu, Shixin Ye, Xin Huang et al.ICDE 2025 · 2 citations
