Loading [a11y]/accessibility-menu.js
A D-Truss-Equivalence Based Index for Community Search Over Large Directed Graphs | IEEE Journals & Magazine | IEEE Xplore

A D-Truss-Equivalence Based Index for Community Search Over Large Directed Graphs


Abstract:

Community Search (CS) aims to enable online and personalized discovery of communities. Recently, attention to the CS problem in directed graphs (di-graph) needs to be imp...Show More

Abstract:

Community Search (CS) aims to enable online and personalized discovery of communities. Recently, attention to the CS problem in directed graphs (di-graph) needs to be improved despite the extensive study conducted on undirected graphs. Nevertheless, the existing studies are plagued by several shortcomings, e.g., Achieving high-performance CS while ensuring the retrieved community is cohesive is challenging. This paper uses the D-truss model to address the limitations of investigating the CS problem in large di-graphs. We aim to implement millisecond-level D-truss CS in di-graphs by building a summarized graph index. To capture the interconnectedness of edges within D-truss communities, we propose an innovative equivalence relation known as D-truss-equivalence, which allows us to divide the edges in a di-graph into a sequence of super nodes (s-nodes). These s-nodes form the D-truss-equivalence-based index, DEBI, an index structure that preserves the truss properties and ensures efficient space utilization. Using DEBI, CS can be performed without time-consuming access to the original graph. The experiments indicate that our method can achieve millisecond-level D-truss community query while ensuring high community quality. In addition, dynamic maintenance of indexes can also be achieved at a lower cost.
Published in: IEEE Transactions on Knowledge and Data Engineering ( Volume: 36, Issue: 11, November 2024)
Page(s): 5482 - 5494
Date of Publication: 26 April 2024

ISSN Information:

Funding Agency:


References

References is not available for this document.