Optimum data base reorganization points
Communications of the ACMPublished 1 June 1973Open access
Ben Shneiderman
Citations65
SJR quartileQ1
SJR score1.15
SNIP3.34
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper examines strategies for selecting the optimum reorganization points in data base organization schemes and concludes that the high cost of a reorganization prohibits frequent reorganizations.
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
Computer Science
Data base task group report to the CODASYL programming language committee, April 1971
153 Citations1971A. Metaxides, William Helgeson +20 more
Communications of the ACMOptimizing binary trees grown with a sorting algorithm
37 Citations1972William A. Martin, David N. Ness
Items can be retrieved from binary trees grown with a form of the Algorithm Quicksort in an average time proportional to log n, where n is the number of items in the tree.
Management ScienceReplacement of Randomly Deteriorating Equipment
12 Citations1963Mark Eisen, Martin L. Leibowitz