rum-conjecture · research · also Read-update-memory conjecture

RUM conjecture

The RUM conjecture proposes that bounding two of an access method's read, update and memory overheads constrains the third.

The 2016 paper presents a conjecture, not a general proof or a numerical formula for a particular engine. It also allows improvements in all three costs through engineering or computation. [1]

Memory includes storage space, not just DRAM. Costs must be scoped to a hierarchy level; moving work into a RAM buffer does not make that work disappear. [1]

Relations

related
Read amplification, Database write amplification, Space amplification, Key-value separation

Citations

  1. Athanassoulis et al. Designing Access Methods: The RUM Conjecture. EDBT 2016, pp. 461-466, sections 1-4. DOI: 10.5441/002/edbt.2016.42. (accessed 2026-11-13)

Further reading

  1. Hesela: matching measurement boundaries before comparing storage engines. (accessed 2026-11-13)
Sources & caveats
  • Source synthesis from the original visionary paper; not an experimental validation or a claim about subsequent proof status.

JSON: /data/terms/rum-conjecture.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. RUM conjecture. Hesela. 2026-11-13. https://hesela.dev/terms/rum-conjecture/