mlsanityData to 7 Oct 2026

SPARE: A Single-Pass Neural Model for Relational Databases

arXiv 2310.13581 ↗First posted 20 Oct 2023cs.DB cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 4 of its 7 references that are in the map. First posted on arXiv 20 Oct 2023.

Builds on

4 of 7 references.

References · 4

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2018How Powerful are Graph Neural Networks?cited by 4,355
  3. 2017Deep Setscited by 1,394
  4. 2015Gated Graph Sequence Neural Networkscited by 792

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 2.

4 papers.