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:2606. 03040v1 Announce Type: new Abstract: Relational databases underpin modern enterprise, scientific, and healthcare systems, yet predictive machine learning on such data remains challenging due to their multi-table, heterogeneous, and temporal structure.
By Phillip Jiang
arXiv:2609.26658v1 Announce Type: cross
Abstract: Integrating heterogeneous datasets within data lakes is a critical challenge, particularly for semantically related tables that lack the explicit att...
By Md Ataur Rahman, Dimitris Sacharidis, Oscar Romero, Sergi Nadal
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
arXiv:2606. 28916v1 Announce Type: cross Abstract: We introduce GRAB, a constructor-encoder-bridge pipeline for table question answering.
By Simone Varriale, Tamara Cucumides, Floris Geerts, Paolo Papotti
H2Table introduces a hierarchical hypergraph representation for complex tables, enabling a hypergraph encoder to capture semantic relationships between headers and cells. The framework uses learnable query vectors to extract structural embeddings for large language models. Experiments on the HiTab dataset show a 22.88% improvement over state‑of‑the‑art baselines on tables with four levels of nesting.
By Jia Ling, Yangfan Wang, Chen Tang, Haoming Tan, Yang Yang, Yi Guan, Jingchi Jiang
Relational Deep Learning (RDL) models multi-table databases as heterogeneous temporal graphs, and graph transformers currently achieve state-of-the-art performance on benchmarks like RelBench. However...
Tables are ubiquitous across diverse domains, yet reasoning over them remains a significant challenge for modern large language models (LLMs). Current approaches typically linearize tables into sequen...
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
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:2506.05626v3 Announce Type: replace
Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
By Xiaohua Lu, Liubov Tupikina, Mehwish Alam
The paper introduces Table Graph Reasoner (TabGR), a model that represents tables as an Attributed Table Graph (ATG) to preserve row-column-cell structure and enable graph-based reasoning without task-specific training. It also proposes a Question-Guided Personalized PageRank (QG-PPR) mechanism to rerank tabular data and address the lost-in-the-middle issue. Experiments on multiple table reasoning benchmarks show that TabGR outperforms state-of-the-art models by up to 9.7% in accuracy.
By Yuxiang Wang, Junhao Gan, Shengxiang Gao, Shenghao Ye, Zhengyi Yang, Jianzhong Qi