Optimal Policies for Data Base Reorganization

Haim Mendelson and Uri Yechiali
Additional contact information
Haim Mendelson: University of Rochester, Rochester, New York
Uri Yechiali: Tel Aviv University, Tel Aviv, Israel

Operations Research, 1981, vol. 29, issue 1, 23-36

Abstract: One of the problems faced by a Data Base Administrator is the determination of a file reorganization policy. The Data Base Administrator has to balance the benefits of a reorganization, which restores processing efficiency and hence reduces operating costs, against the extra expenditures involved (unloading and reloading the files, system unavailability costs, etc.). In this paper we consider both policies of state-dependent reorganization and reorganization at fixed time intervals. We prove that the optimal state-dependent policy belongs to the class of control-limit rules, and show how the optimal control-limit can be evaluated. We then consider the policy of reorganization at fixed time intervals, and show that, when the record arrival process is Poisson, this policy is always inferior to the optimal control-limit rule (for the average-cost criterion). We conclude with an example where operating and reorganization costs increase linearly with system occupancy.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.1.23 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:1:p:23-36

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().