Bibliographic record
Abstract
This chapter introduces autonomic computing as a means to automate the complex tuning, configuration, and optimization tasks that are currently the responsibility of the database administrator. We describe an algorithm called the dynamic reconfiguration algorithm (DRF) that can be implemented as part of an autonomic database management system (DBMS) to manage the DBMS buffer pools, which are a key resource in a DBMS. DRF is an iterative algorithm that uses greedy heuristics to find a reallocation that benefits a target transaction class. DRF uses the principle of goal-oriented resource management. We define and motivate the cost- estimate equations used in the algorithm and present the results of a set of experiments to investigate the performance of the algorithm.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.023 | 0.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.001 | 0.006 |
| Scholarly communication | 0.002 | 0.055 |
| Open science | 0.012 | 0.011 |
| Research integrity | 0.001 | 0.010 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
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".