Maintaining range trees in secondary memory: Part II: Lower bounds
MHM Smid, MH Overmars�- Acta Informatica, 1990 - Springer
MHM Smid, MH Overmars
Acta Informatica, 1990•SpringerWhen 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.
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.
Summary
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.
Springer
Showing the best result for this search. See all results