mlsanityData to 14 Oct 2026

Fast Factorized Learning: Powered by In-Memory Database Systems

arXiv 2512.09836 ↗First posted 10 Dec 2025cs.DB cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Learning models over factorized joins avoids redundant computations by identifying and pre-computing shared cofactors. Previous work has investigated the performance gain when computing cofactors on traditional disk-based database systems. Due to the absence of published code, the experiments could not be reproduced on in-memory database systems. This work describes the implementation when using cofactors for in-database factorized learning. We benchmark our open-source implementation for learning linear regression on factorized joins with PostgreSQL -- as a disk-based database system -- and HyPer -- as an in-memory engine. The evaluation shows a performance gain of factorized learning on in-memory database systems by 70% to non-factorized learning and by a factor of 100 compared to disk-based database systems. Thus, modern database engines can contribute to the machine learning pipeline by pre-computing aggregates prior to data extraction to accelerate training.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 10 Dec 2025.

Builds on

2 of 10 references.

References · 2

  1. 2019A Layered Aggregate Engine for Analytics Workloadscited by 12
  2. 2023JoinBoost: Grow Trees Over Normalized Data Using Only SQLcited by 4

Built on by

Not cited yet.