Optimum data base reorganization points

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimum data base reorganization points

Full text

Pdf (334 KB)

Source

Communications of the ACM archive
Volume 16 , Issue 6 (June 1973) table of contents

Pages: 362 - 365

Year of Publication: 1973

ISSN:0001-0782

Author

Ben Shneiderman

State Univ. of New York at Stony Brook, Stony Brook

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 26

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

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/362248.362267 What is a DOI?

ABSTRACT

In certain data base organization schemes the cost per access may increase due to structural inefficiencies caused by update. By reorganizing the data base the cost per access may be reduced. However, the high cost of a reorganization prohibits frequent reorganizations. This paper examines strategies for selecting the optimum reorganization points.

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	Eisen, M., and Leibowitz, M. Replacement of randomly deteriorating equipment. Management Science 9 (Jan. 1963), 263-276.
	2	W. A. Martin , D. N. Ness, Optimizing binary trees grown with a sorting algorithm, Communications of the ACM, v.15 n.2, p.88-93, Feb. 1972 [doi>10.1145/361254.361259]
	3	IBM System/360 Operating System Data Management Services. Order Number GC 26-3746, IBM, White Plains, N.Y.
	4	CODASYL-Data Base Task Group Report (Apr. 1971), ACM, New York.
	5	Data Base Management System Requirements, Joint GUIDE/SHARE Data Base Requirements Group (Nov. 11, 1970).

CITED BY 26

	Ben Shneiderman, Opportunities for data base reorganization, ACM SIGMOD Record, v.6 n.4, p.1-8, 1974
	William G. Tuel, Jr., Optimum reorganization points for linearly growing files, ACM Transactions on Database Systems (TODS), v.3 n.1, p.32-40, March 1978
	Donald L. Adolphson , Glenn N. Thomas, Optimum ordered hash tables, Proceedings of the 1977 annual conference, p.74-78, January 1977
	K. Sundar Das , T. J. Teorey , S. B. Yao, Reorganization points for file designs with nonlinear processing costs, Proceedings of the 1st International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts
	K. Maruyama , S. E. Smith, Optimal reorganization of distributed space disk files, Communications of the ACM, v.19 n.11, p.634-642, Nov. 1976
	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
	Peter Zabback , Ibrahim Onyuksel , Peter Scheuermann , Gerhard Weikum, Database Reorganization in Parallel Disk Arrays with I/O Service Stealing, IEEE Transactions on Knowledge and Data Engineering, v.10 n.5, p.855-858, September 1998
	L. E. Winslow , J. C. Lee, Optimal choice of data restructuring points, Proceedings of the 1st International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts
	Haim Mendelson , Joseph S. Pliskin , Uri Yechiali, Optimal storage allocation for serial files, Communications of the ACM, v.22 n.2, p.124-130, Feb. 1979
	Daniel P. Heyman, Mathematical models of database degradation, ACM Transactions on Database Systems (TODS), v.7 n.4, p.615-631, Dec. 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
	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, 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
	Fred J. Maryanski, An architecture for fault tolerance in database systems, Proceedings of the ACM 1980 annual conference, p.389-398, January 1980
	Guy M. Lohman , John A. Muckstadt, Optimal policy for batch operations: backup, checkpointing, reorganization, and updating, ACM Transactions on Database Systems (TODS), v.2 n.3, p.209-222, Sept. 1977
	K. Dan Levin, Adaptive structuring of distributed databases, Proceedings of the June 7-10, 1982, national computer conference, June 07-10, 1982, Houston, Texas
	Witold Litwin, Virtual hashing: a dynamically changing hashing, Proceedings of the fourth international conference on Very Large Data Bases, p.517-523, September 13-15, 1978, West Berlin, Germany
	Daniel J. Rosenkrantz, Dynamic database dumping, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas
	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
	Witold Litwin, Linear hashing: a new tool for file and table addressing, Proceedings of the sixth international conference on Very Large Data Bases, p.212-223, October 01-03, 1980, Montreal, Quebec, Canada
	George Copeland , William Alexander , Ellen Boughter , Tom Keller, Data placement in Bubba, ACM SIGMOD Record, v.17 n.3, p.99-108, June 1988
	Masaru Kitsuregawa , Kazuo Goda , Takashi Hoshino, Storage fusion, Proceedings of the 2nd international conference on Ubiquitous information management and communication, January 31-February 01, 2008, Suwon, Korea
	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
	T. H. Merrett, Database cost analysis: a top-down approach, Proceedings of the 1977 ACM SIGMOD international conference on Management of data, August 03-05, 1977, Toronto, Ontario, Canada
	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
	Gary H. Sockut , Robert P. Goldberg, Database Reorganization—Principles and Practice, ACM Computing Surveys (CSUR), v.11 n.4, p.371-395, Dec. 1979

INDEX TERMS

Keywords:
data base, files, information retrieval, reorganization

Collaborative Colleagues:

Ben Shneiderman: colleagues

Peer to Peer - Readers of this Article have also read:

Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
The GemStone object database management system Communications of the ACM 34, 10
Paul Butterworth , Allen Otis , Jacob Stein
Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM 34, 12
Ellen Francik , Susan Ehrlich Rudman , Donna Cooper , Stephen Levine
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen , Daniel D. Gajski

Adobe Acrobat

QuickTime

Windows Media Player

Real Player