This paper deals with I/O throughput maximization in a single processo
r/multidisk database system, by means of optimal allocation of entire
relations (or other nonfragmented data objects) to disks. We examine t
he cases in which such allocation is beneficial, and present a mathema
tical formulation of the problem. This formulation is shown to be flex
ible enough to accommodate various objectives and.constraints of a typ
ical system design.