Optimal reorganization policies for stationary and evolutionary databases

Optimal reorganization policies for stationary and evolutionary databases

0.00 Avg rating0 Votes
Article ID: iaor19916
Country: United States
Volume: 36
Issue: 5
Start Page Number: 613
End Page Number: 631
Publication Date: May 1990
Journal: Management Science
Authors: , , ,
Keywords: programming: dynamic, stochastic processes
Abstract:

The problem of determining optimal reorganization policies for databases which employ file structures with overflow chaining is studied. The dynamics of the file performance driven by update transactions and reorganizations is formulated as a stochastic control model which incorporates micro-level design parameters of the physical file structure. Various simplifying assumptions employed in past research are relaxed in the model. Polynomial time procedures for solving the optimization models are developed for two cases: when the file size is stationary as in the steady-state and when the file size evolves stochastically with a nonlinear trajectory. The model and the solution procedures are applied to an ISAM file revealing the effectiveness of the solution procedures and the relationships between file design parameters and the optimal policy.

Reviews

Required fields are marked *. Your email address will not be published.