MétaCan
Menu
Back to cohort
Record W2104761699 · doi:10.1109/ideas.2004.64

Using reflection to introduce self-tuning technology into DBMSs

2004· article· en· W2104761699 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Database Engineering and Applications Symposium · 2004
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Database Systems and Queries
Canadian institutionsAcadia UniversityQueen's University
Fundersnot available
KeywordsComputer scienceReflection (computer programming)Task (project management)Autonomic computingDistributed computingProgramming languageOperating systemCloud computing

Abstract

fetched live from OpenAlex

The increasing complexity of database management systems (DBMSs) and their workloads means that manually managing their performance has become a difficult and time-consuming task. Autonomic computing systems have emerged as a promising approach to dealing with this complexity. Current DBMSs have begun to move in the direction of autonomic computing with the introduction of parameters that can be dynamically adjusted. A logical next step is the introduction of self-tuning technology to diagnose performance problems and to select the dynamic parameters that must be adjusted. We introduce a method for automatically diagnosing performance problems in DBMSs and then describe how this method can be incorporated into current DBMSs using the concept of reflection. We demonstrate the feasibility of our approach with a proof-of-concept implementation for DB2 universal database.

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.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.726
Threshold uncertainty score0.584

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.001
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.010
GPT teacher head0.271
Teacher spread0.261 · 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