MAINTAINING RANGE TREES IN SECONDARY MEMORY .2. LOWER BOUNDS

When storing and maintaining a data structure in secondary memory it is important to partition it into parts such that each query and update passes through a small number of parts. In this way the number of disk accesses and the amount of data transport required can be kept low. In Part I of this paper a number of partition schemes were given for partitioning range trees. In this paper we study lower bounds for partitions. In this way we prove that many of the partitions given in Part I are optimal. © 1990 Springer-Verlag.