Optimum reorganization points for arbitrary database costs

DOI10.1007/BF00625278zbMath0493.68104MaRDI QIDQ1168763

Raul J. Ramirez, J. Ian Munro, Frank Wm. Tompa

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

data structuresdynamic programming algorithmdatabasesshortest route problemperformance deterioration

Mathematics Subject Classification ID

Dynamic programming (90C39) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• The art and theory of dynamic programming
• Optimum data base reorganization points

This page was built for publication: Optimum reorganization points for arbitrary database costs