caa a22 4500 467989907 CHVBK 20180323112541.0 cr unu---uuuuu 170328e19900401xx s 000 0 eng 10.1007/BF00289019 doi (NATIONALLICENCE)springer-10.1007/BF00289019 Maintaining range trees in secondary memory [Elektronische Daten] Part II: Lower bounds [Michiel Smid, Mark Overmars] 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-Verlag, 1990 Smid Michiel Departments of Mathematics and Computer Science, University of Amsterdam, Plantage Muidergracht 24, NL-1018, TV Amsterdam, The Netherlands aut Overmars Mark Department of Computer Science, University of Utrecht, P.O. Box 80.089, NL-3508, TB Utrecht, The Netherlands aut Acta Informatica Springer-Verlag 27/5(1990-04-01), 453-480 0001-5903 27:5<453 1990 27 236 https://doi.org/10.1007/BF00289019 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00289019 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Smid Michiel Departments of Mathematics and Computer Science, University of Amsterdam, Plantage Muidergracht 24, NL-1018, TV Amsterdam, The Netherlands aut NATIONALLICENCE 700 1- Overmars Mark Department of Computer Science, University of Utrecht, P.O. Box 80.089, NL-3508, TB Utrecht, The Netherlands aut NATIONALLICENCE 773 0- Acta Informatica Springer-Verlag 27/5(1990-04-01), 453-480 0001-5903 27:5<453 1990 27 236 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer