MetaSieve is a metapath selection layer that reduces subgraph size in relational deep learning by pruning uninformative metapaths using SQL join and aggregation statistics. It scores candidate metapath extensions with a lightweight function that favors informative yet lightweight paths, discarding those below a threshold. The method is independent of GNN parameters and, when applied to the RelBench benchmark, consistently cuts per‑epoch training time while preserving or improving accuracy.
By Fahim Shahriar Khan, Ashraf Aboulnaga
arXiv:2606. 08491v1 Announce Type: new Abstract: Relational deep learning (RDL) converts relational databases (RDBs) into heterogeneous graphs, but graphs derived directly from database schemas are often not well suited for how graph neural networks (GNNs) perform relational reasoning.
By Yao Cheng, Siqiang Luo
arXiv:2609.01292v1 Announce Type: cross
Abstract: Relational Deep Learning (RDL) has become a powerful paradigm for learning from multi-tabular data. However, manually defining RDL prediction tasks i...
By Oleksii Kolesnichenko, Jakub Pele\v{s}ka, Gustav \v{S}\'{\i}r
MetaRTL is a two-stage framework for relational table learning that first generates lightweight pre-trained table embeddings and then applies non‑parametric message passing to extract meta‑path features. These features are aggregated using an attention module called MetaAttn, shifting computation from deep GNN stacks to efficient meta‑path aggregation. Experiments on 10 real‑world datasets across 24 tasks show that MetaRTL achieves strong performance while reducing computational cost.
By Ken Zhong, Weichen Li, Zheng Wang
arXiv:2607. 03659v1 Announce Type: cross Abstract: Relational databases (RDBs) are the primary data infrastructure in many enterprises, yet recent deep learning methods designed for RDBs have been evaluated under inconsistent experimental protocols, making fair comparison difficult.
By Kazi F. Akhter, Bharath Ajendla, Manar D. Samad
arXiv:2608. 11431v1 Announce Type: new Abstract: Graph learning presupposes a graph, and tables and relational databases do not come with one.
By Tamara Cucumides, Floris Geerts
arXiv:2608. 13023v1 Announce Type: new Abstract: Relational Deep Learning (RDL) models multi-tabular databases as temporal heterogeneous graphs to enable end-to-end representation learning.
By Jakub Pele\v{s}ka, Gustav \v{S}\'ir
arXiv:2609.26855v1 Announce Type: cross
Abstract: Relational Deep Learning (RDL) models multi-table databases as heterogeneous temporal graphs, and graph transformers currently achieve state-of-the-a...
By Kyaw Hpone Myint, Nan Jiang, Xiang Li, Zhe Wu, Alexandre G. R. Day, Pranab Mohanty, Giri Iyengar
InRTL: Effective Intra-Inter Interaction Learning for Relational Tables proposes a unified framework that explicitly models dependencies both within and across relational tables. The approach introduces intra-table interactions to capture associations among rows in the same table and inter-table interactions to capture dependencies between rows linked by primary key–foreign key relationships. It employs a column-aware table encoder, Transformer-based self-attention and cross-attention modules, and incorporates linearized attention and heterogeneous graph neural networks to improve scalability, demonstrating effectiveness across ten datasets and 24 real-world tasks.
By Weichen Li, Ken Zhong, Zheng Wang, Li Pan, Jianhua Li
arXiv:2606. 29773v1 Announce Type: new Abstract: Graphs are widely used to model relational systems, with applications in domains such as social networks, finance, and biomedicine.
By Haoxin Sun, Yiqing Lin, Yajun Huang, Chenhui Dong, Mingjun Li, Zhongzhi Zhang
The paper investigates whether large language models (LLMs) can leverage frozen relational‑transformer embeddings by injecting them as soft tokens. Using a learned MLP projection and LoRA adaptation, the authors fine‑tune Qwen3.5‑4B on chain‑of‑thought reasoning traces and group‑based reinforcement learning, then evaluate on ten binary classification tasks across six RelBench databases. The hybrid approach consistently underperforms the standalone relational transformer, showing sensitivity to serialization format, token budget, and RL stability, leading the authors to conclude that stronger alignment objectives and schema‑aware design are needed for reliable relational prediction.
By Francisco Galuppo Azevedo, Clarissa Lima Loures
arXiv:2607. 05476v1 Announce Type: new Abstract: Given a relational database (RDB) storing heterogeneous tabular information, how can we predict missing (or future) values in some target column of interest?
By Linjie Xu, David Wipf