MétaCan
Menu
Back to cohort
Record W4411374395 · doi:10.1145/3722212.3725096

Demo of LearnedWMP: Workload Memory Prediction Using Deep Query Template Representations

2025· article· en· W4411374395 on OpenAlexaff
Shaikh Quader, Ghadeer Abuoda, Yonis Abokar, Marin Litoiu, Manos Papagelis

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceWorkloadArtificial intelligenceQuery optimizationInformation retrievalParallel computingData miningOperating system

Abstract

fetched live from OpenAlex

The database management system (DBMS) relies on a limited amount of working memory for in-memory operations during query execution. Inaccurate estimations can result in suboptimal query performance and potential failures. Achieving precise working memory estimations is therefore crucial to enhance the DBMS efficiency. We present LearnedWMP, a novel approach for simultaneously estimating working memory for a set of queries (i.e., a workload), as opposed to the conventional practice of estimating resources separately for each query. In a series of comprehensive experiments, the LearnedWMP model demonstrates improved accuracy in memory estimation and faster performance during both training and inference when compared to standard methods. The findings highlight the effectiveness and potential impact of the LearnedWMP approach on optimizing query performance. The audience can explore LearnedWMP through various scenarios showcasing its estimation accuracy and internal model workings.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.453
Threshold uncertainty score0.323

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.303
Teacher spread0.280 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207