Pith. sign in

REVIEW 2 cited by

DeepDB: Learn from Data, not from Queries!

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 1909.00607 v1 pith:GIU2CESU submitted 2019-09-02 cs.DB

classification cs.DB
keywords dataqueriesapproachdata-drivenmodelaccuracybetterchanges
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The typical approach for learned DBMS components is to capture the behavior by running a representative set of queries and use the observations to train a machine learning model. This workload-driven approach, however, has two major downsides. First, collecting the training data can be very expensive, since all queries need to be executed on potentially large databases. Second, training data has to be recollected when the workload and the data changes. To overcome these limitations, we take a different route: we propose to learn a pure data-driven model that can be used for different tasks such as query answering or cardinality estimation. This data-driven model also supports ad-hoc queries and updates of the data without the need of full retraining when the workload or data changes. Indeed, one may now expect that this comes at a price of lower accuracy since workload-driven models can make use of more information. However, this is not the case. The results of our empirical evaluation demonstrate that our data-driven approach not only provides better accuracy than state-of-the-art learned components but also generalizes better to unseen queries.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index

    cs.DB 2025-05 conditional novelty 7.0 of 10

    SSCard estimates substring cardinality using a pruned suffix tree over an FM-index, with learned spline rank functions and an error bound, achieving lower q-error and smaller space than prior methods on five datasets.

  2. Synthesize, Retrieve, and Propagate: A Unified Predictive Modeling Framework for Relational Databases

    cs.DB 2025-08 unverdicted novelty 5.0 of 10

    SRP combines feature synthesis, cross-table retrieval, and graph propagation to improve predictive modeling on relational databases.

Pith tools