Answers are grounded in this paper and cite their sources.
Structuring database records by considering data item usage can yield substantial efficiencies in the operating cost of database systems. However, since the number of possible physical record structures for database of practical significance is enormous, and their evaluation is extremely complex, determining efficient record structures by full enumeration is generally infeasible. This paper discusses the techniques of mathematical clustering, iterative grouping refinement, mathematical programming, and hierarchic aggregation, which can be used to quickly determine efficient record structures for large, shared databases.
No takes yet. Share an insight, caveat, or question.
Salvatore T. March (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: