Pith. sign in

REVIEW 1 cited by

Extending Relational Query Processing with ML Inference

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 1911.00231 v1 pith:Q44U56JU submitted 2019-11-01 cs.DB cs.LG

classification cs.DBcs.LG
keywords performanceabovedataenterpriseinferenceintegrationnativeprocessing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The broadening adoption of machine learning in the enterprise is increasing the pressure for strict governance and cost-effective performance, in particular for the common and consequential steps of model storage and inference. The RDBMS provides a natural starting point, given its mature infrastructure for fast data access and processing, along with support for enterprise features (e.g., encryption, auditing, high-availability). To take advantage of all of the above, we need to address a key concern: Can in-RDBMS scoring of ML models match (outperform?) the performance of dedicated frameworks? We answer the above positively by building Raven, a system that leverages native integration of ML runtimes (i.e., ONNX Runtime) deep within SQL Server, and a unified intermediate representation (IR) to enable advanced cross-optimizations between ML and DB operators. In this optimization space, we discover the most exciting research opportunities that combine DB/Compiler/ML thinking. Our initial evaluation on real data demonstrates performance gains of up to 5.5x from the native integration of ML in SQL Server, and up to 24x from cross-optimizations--we will demonstrate Raven live during the conference talk.

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. Picachv: Formally Verified Data Use Policy Enforcement for Secure Data Analytics

    cs.CR 2025-01 conditional novelty 7.0 of 10

    Picachv formalizes data-use policies and relational algebra semantics in Coq, and implements a runtime monitor in Rust that blocks analytics queries that violate privacy policies.

Pith tools