ExtGraph: A Fast Extraction Method of User-intended Graphs from a Relational Database

πŸ“… 2025-09-22
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
To address inefficient graph data extraction and inaccurate intent matching from relational databases, this paper proposes ExtGraphβ€”a user-intent-driven, efficient graph extraction method. ExtGraph innovatively integrates outer joins with materialized views to establish a hybrid query processing mechanism that precisely reconstructs user-specified graph structures under complex multi-table join scenarios. It employs query rewriting, precomputed materialized views, and lightweight optimization strategies to substantially reduce graph construction overhead. Experimental evaluation on TPC-DS, DBLP, and IMDb datasets demonstrates that ExtGraph achieves up to 2.78Γ— speedup over state-of-the-art approaches, while preserving both structural integrity and semantic fidelity of the extracted graphs. This work establishes a novel, efficient, and scalable paradigm for end-to-end relational-to-graph transformation, bridging the gap between relational data management and graph analytics.

Technology Category

Application Category

πŸ“ Abstract
Graph analytics is widely used in many fields to analyze various complex patterns. However, in most cases, important data in companies is stored in RDBMS's, and so, it is necessary to extract graphs from relational databases to perform graph analysis. Most of the existing methods do not extract a user-intended graph since it typically requires complex join query processing. We propose an efficient graph extraction method, extit{ExtGraph}, which can extract user-intended graphs efficiently by hybrid query processing of outer join and materialized view. Through experiments using the TPC-DS, DBLP, and IMDB datasets, we have shown that extit{ExtGraph} outperforms the state-of-the-art methods up to by 2.78x in terms of graph extraction time.
Problem

Research questions and friction points this paper is trying to address.

Efficiently extracting user-intended graphs from relational databases
Overcoming complex join query processing limitations in graph extraction
Improving graph extraction speed compared to existing state-of-the-art methods
Innovation

Methods, ideas, or system contributions that make the work stand out.

Hybrid query processing with outer join
Materialized view for efficient extraction
Faster graph extraction from relational databases
πŸ”Ž Similar Papers
No similar papers found.
J
Jeongho Park
GraphAI, Daejeon, Republic of Korea
G
Geonho Lee
KAIST, Daejeon, Republic of Korea
Min-Soo Kim
Min-Soo Kim
School of Computing, KAIST
Databasedata miningmachine learningbioinformaticsdistributed/parallel computing