Optimum reorganization points for arbitrary database costs

DOI10.1007/BF00625278zbMATH Open0493.68104MaRDI QIDQ1168763FDOQ1168763

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

Publication date: 1982

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

zbMATH Keywords

data structuresdatabasesdynamic programming algorithmshortest route problemperformance deterioration

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168763)