The question
Can a low-overhead cache policy improve retrieval cost across variable object sizes, scans and shifting popularity?
This is a proposed research direction. No novel algorithm, completed benchmark or performance gain is claimed.
Why it matters
Database caches, storage gateways and content-delivery platforms could improve hit rates and reduce backend load.
Search space
Admission rules, queue structures, frequency estimators and cost-aware eviction.
What would count as progress?
- Request/byte miss ratios
- backend retrieval cost
- metadata bytes
- concurrent throughput
- tail latency.
A useful result improves a measured trade-off against strong baselines on held-out workloads, with reproducible code and documented limitations.
Baselines and boundaries
Compare LRU, frequency-aware admission and S3-FIFO. Replay held-out traces; account for variable sizes, warm-up, metadata and synchronization overhead.
Starting reference
Where you could contribute
Help define representative, legally shareable workloads; critique the correctness contract; implement baselines; propose candidates; or reproduce measurements. Negative results and failure cases are useful contributions.
A detailed research brief is being prepared. Access requests will become available when that brief and the request service are ready.