Pith. sign in

REVIEW 1 cited by

SPARE: A Single-Pass Neural Model for Relational Databases

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.13581 v1 pith:ONX6RL7Q submitted 2023-10-20 cs.DB cs.AI

classification cs.DBcs.AI
keywords gnnsneuralrelationalsparetrainingwhiledatabasesmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rel-HNN: Split Parallel Hypergraph Neural Network for Learning on Relational Databases

    cs.DB 2025-07 reject novelty 5.0 of 10

    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.

Pith tools