@article {17311,
	title = {Optimum data base reorganization points},
	journal = {Communications of the ACM},
	volume = {16},
	year = {1973},
	month = {1973/06//},
	pages = {362 - 365},
	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.},
	keywords = {data base, files, Information retrieval, reorganization},
	isbn = {0001-0782},
	doi = {10.1145/362248.362267},
	url = {http://doi.acm.org/10.1145/362248.362267},
	author = {Shneiderman, Ben}
}
