Optimal Choice of Data Restructuring Points.

Leon E. Winslow, J. C. Lee: Optimal Choice of Data Restructuring Points. VLDB 1975: 353-363
  author    = {Leon E. Winslow and
               J. C. Lee},
  editor    = {Douglas S. Kerr},
  title     = {Optimal Choice of Data Restructuring Points},
  booktitle = {Proceedings of the International Conference on Very Large Data
               Bases, September 22-24, 1975, Framingham, Massachusetts, USA},
  publisher = {ACM},
  year      = {1975},
  pages     = {353-363},
  ee        = {db/conf/vldb/WinslowL75.html},
  crossref  = {DBLP:conf/vldb/75},
  bibsource = {DBLP,}


Maintaining access efficiency to a data base as updates and/or usage patterns change often requires restructuring the data base. While analytical methods are available for determlning the optimal point to restructure, they assume the mean access cost is a smooth function of time or the number of accesses and can be measured exactly at any point in time. The access cost inpractice often varies, at least in the short run, in a random manner. This implies a non- zero probability of deciding the optimal reorganization point has been reached when in fact it has not. Determination of the optimal reorganization point must take into account the random behavior of the accesscost and the probability (and cost) of deciding too early or too late to perform the reorganization. A technique for choosing the optimal reorganization point subject to random variation in the access cost is developed and some examples are presented.

Copyright © 1975 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Douglas S. Kerr (Ed.): Proceedings of the International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts, USA. ACM 1975
Contents BibTeX


P. A. Dearnley: A Model of a Self-Organising Data Management System. Comput. J. 17(1): 13-16(1974) BibTeX
P. A. Dearnley: The Operation of a Model Self Organising Data Management System. Comput. J. 17(3): 205-210(1974) BibTeX
Ben Shneiderman: Optimum Data Base Reorganization Points. Commun. ACM 16(6): 362-365(1973) BibTeX
Peter M. Stocker, P. A. Dearnley: Self-Organising Data Management Systems. Comput. J. 16(2): 100-105(1973) BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:44:52 2009