SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization

Yudong Niu, Yuchen Li, Jiaxin Jiang, Laks V. S. Lakshmanan

Track: Graph algorithms and modeling for the Web

Keywords: densest subgraph discovery, relational graph, neighborhood-summary, materialization-free

TL;DR: We propose a novel materialization-free approach for densest subgraph discovery over relational graphs induced by meta-paths from heterogeneous data sources.

Abstract:

How can we efficiently identify the densest subgraph over relational graphs? Existing dense subgraph discovery (DSD) approaches assume that a relational graph $H$ is already derived from a heterogeneous data source and they focus on efficient discovery of the densest subgraph on the materialized $H$. Unfortunately, materializing relational graphs can be resource-intensive, which thus limits the practical usefulness of existing algorithms over large datasets. To mitigate this, we propose a novel Summary-bAsed deNsest Subgraph discovery (SANS) system. Our unique summary-based peeling algorithm forms the core of SANS. Following the peeling paradigm, it utilizes summaries of each node's neighborhood to efficiently estimate peeling coefficients and subgraph densities at each peeling iteration and thus avoids materializing the relational graph completely.
Through extensive experiments, we demonstrate the efficacy and efficiency of SANS, reaching orders of magnitude speedups compared to the conventional baselines with materialization, while consistently achieving at least 95% accuracy compared to peeling algorithms based on materialization.

Submission Number: 1393