Relational Database Distillation: From Structured Tables to Condensed Graph Data

Relational databases (RDBs) underpin the majority of global data management systems, where information is structured into multiple interdependent tables. In social media platforms, for instance, massive user-generated data are organized across related tables such as users, posts, comments, and interactions, enabling large-scale analysis and predictive modeling of social behaviors. To effectively use the knowledge within RDBs for predictive tasks, recent advances leverage graph representation learning to capture complex inter-table relations as multi-hop dependencies. Despite achieving state-of-the-art performance, these methods remain hindered by the prohibitive storage overhead and excessive training time, due to the massive scale of database and the computational burden of intensive message passing across interconnected tables. To alleviate these concerns, we propose and study the problem of Relational Database Distillation (RDD). Specifically, we aim to distill largescale RDBs into compact heterogeneous graphs while retaining the predictive power (i.e., utility) required for training graph-based models. Multi-modal column information is preserved through node features, and primary-foreign key relations are encoded via heterogeneous edges, thereby maintaining both data fidelity and relational structure. To ensure adaptability across diverse downstream tasks without engaging the traditional, inefficient bi-level distillation framework, we further design a kernel ridge regression-guided objective with pseudo-labels, which produces quality features for the distilled graph. Extensive experiments on multiple real-world RDBs demonstrate that our solution substantially reduces the data size while maintaining competitive performances on classification and regression tasks, creating an effective pathway for scalable learning with RDBs. CCS Concepts • Computing methodologies → Neural networks.