Optimum reorganization points for linearly growing files

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimum reorganization points for linearly growing files

Full text

Pdf (455 KB)

Source

ACM Transactions on Database Systems (TODS) archive
Volume 3 , Issue 1 (March 1978) table of contents

Pages: 32 - 40

Year of Publication: 1978

ISSN:0362-5915

Author

William G. Tuel, Jr.

IBM Corp., Palo Alto, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 11

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/320241.320244 What is a DOI?

ABSTRACT

The problem of finding optimal reorganization intervals for linearly growing files is solved. An approximate reorganization policy, independent of file lifetime, is obtained. Both the optimum and approximate policies are compared to previously published results using a numerical example.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ben Shneiderman, Optimum data base reorganization points, Communications of the ACM, v.16 n.6, p.362-365, June 1973 [doi>10.1145/362248.362267]
	2	DAs, K.S., TWOREY, T.J., XND YAO, S.B. Reorganization points for filedesignswithnonlinear processing costs (abstract). Proc. Inter. Conf. Very Large Data Bases, Sept. 1975, pp. 516- 517 (available from ACM, New York).
	3	LUENBERC.ER, D.G. Optimization by Vector Space Methods. Wiley, New York, 1969, pp. 216-221.
	4	S. B. Yao , K. S. Das , T. J. Teorey, A dynamic database reorganization algorithm, ACM Transactions on Database Systems (TODS), v.1 n.2, p.159-174, June 1976 [doi>10.1145/320455.320467]

CITED BY 11

	Gary H. Sockut , Robert P. Goldberg, Database Reorganization—Principles and Practice, ACM Computing Surveys (CSUR), v.11 n.4, p.371-395, Dec. 1979
	Y. Manolopoulos , J. G. Kollias, Performance of a two-headed disk system when serving database queries under the scan policy, ACM Transactions on Database Systems (TODS), v.14 n.3, p.425-442, Sept. 1989
	Daniel P. Heyman, Mathematical models of database degradation, ACM Transactions on Database Systems (TODS), v.7 n.4, p.615-631, Dec. 1982
	George Copeland , William Alexander , Ellen Boughter , Tom Keller, Data placement in Bubba, ACM SIGMOD Record, v.17 n.3, p.99-108, June 1988
	D. S. Batory, Optimal file designs and reorganization points, ACM Transactions on Database Systems (TODS), v.7 n.1, p.60-81, March 1982
	Lars Söderlund, Evaluation of concurrent physical database reorganization through simulation modeling, ACM SIGMETRICS Performance Evaluation Review, v.10 n.3, p.19-32, Fall 1981
	C. T. Yu , C. H. Chen, Adaptive information system design: one query at a time, ACM SIGMOD Record, v.14 n.4, p.280-290, May 1985
	Mario Schkolnick, A survey of physical database design methodology and techniques, Proceedings of the fourth international conference on Very Large Data Bases, p.474-487, September 13-15, 1978, West Berlin, Germany
	Lars Söderlund, Concurrent data base reorganization - assessment of a powerful technique through modeling, Proceedings of the seventh international conference on Very Large Data Bases, p.499-509, September 09-11, 1981, Cannes, France
	K. Dan Levin, Adaptive structuring of distributed databases, Proceedings of the June 7-10, 1982, national computer conference, June 07-10, 1982, Houston, Texas
	Gary H. Sockut , Balakrishna R. Iyer, Online reorganization of databases, ACM Computing Surveys (CSUR), v.41 n.3, p.1-136, July 2009