Rel-HNN models each tuple as a hyperedge over attribute-value nodes and reports large accuracy gains, but its hypergraph construction appears to include the target label as an input node.
SPARE: A Single-Pass Neural Model for Relational Databases
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
While there has been extensive work on deep neural networks for images and text, deep learning for relational databases (RDBs) is still a rather unexplored field. One direction that recently gained traction is to apply Graph Neural Networks (GNNs) to RBDs. However, training GNNs on large relational databases (i.e., data stored in multiple database tables) is rather inefficient due to multiple rounds of training and potentially large and inefficient representations. Hence, in this paper we propose SPARE (Single-Pass Relational models), a new class of neural models that can be trained efficiently on RDBs while providing similar accuracies as GNNs. For enabling efficient training, different from GNNs, SPARE makes use of the fact that data in RDBs has a regular structure, which allows one to train these models in a single pass while exploiting symmetries at the same time. Our extensive empirical evaluation demonstrates that SPARE can significantly speedup both training and inference while offering competitive predictive performance over numerous baselines.
citation-role summary
citation-polarity summary
fields
cs.DB 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Rel-HNN: Split Parallel Hypergraph Neural Network for Learning on Relational Databases
Rel-HNN models each tuple as a hyperedge over attribute-value nodes and reports large accuracy gains, but its hypergraph construction appears to include the target label as an input node.