Interoperable server-based cache consistency algorithm
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.
Bibliographic record
Abstract
Numerous caching algorithms have been investigated for the client-server object database management systems. The algorithms not only ensure cache consistency by preventing applications' access to stale data, but they also support transactional properties. Caching algorithms have been classified in a number of ways - one classification is into avoidance and detection categories, depending on whether access to the stale data is avoided, usually by locking, or permitted and then any conflict detected at commit time. Detection-based algorithms have better performance but can lead to high abort rate that is unacceptable for interactive applications. It is for this reason that avoidance-based algorithms are usually adopted in practice. This work describes a server-based interoperable transactional caching algorithm that concurrently supports the leading avoidance-based (adaptive callback locking (ACBL)) and detection-based (adaptive optimistic concurrency control (AOCC)) algorithms. At a client either the avoidance or the detection caching algorithm is used without any changes. It is the server-side caching algorithm that concurrently supports both avoidance and detection client-side caching.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it