Optimum data base reorganization points

42Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 1973, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Shneiderman, B. (1973). Optimum data base reorganization points. Communications of the ACM, 16(6), 362–365. https://doi.org/10.1145/362248.362267

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free