IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v29y1981i1p23-36.html
   My bibliography  Save this article

Optimal Policies for Data Base Reorganization

Author

Listed:
  • Haim Mendelson

    (University of Rochester, Rochester, New York)

  • Uri Yechiali

    (Tel Aviv University, Tel Aviv, Israel)

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.

Suggested Citation

  • Haim Mendelson & Uri Yechiali, 1981. "Optimal Policies for Data Base Reorganization," Operations Research, INFORMS, vol. 29(1), pages 23-36, February.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:1:p:23-36
    DOI: 10.1287/opre.29.1.23
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.1.23
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.1.23?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:29:y:1981:i:1:p:23-36. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.