Optimal Policies for Data Base Reorganization

DOI10.1287/opre.29.1.23zbMath0463.68051OpenAlexW2067004240MaRDI QIDQ3914442

Haim Mendelson, Uri Yechiali

Publication date: 1981

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.29.1.23

zbMATH Keywords

data base administratorrecord arrival

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (3)

Optimally designed renewal reward processes: General framework and applications ⋮ An algorithm for storage device selection and file assignment ⋮ Lattice path combinatorics and linear probing

This page was built for publication: Optimal Policies for Data Base Reorganization