Maintaining range trees is secondary memory. Part II: Lower bounds (Q1120282): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Decomposable searching problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maintaining range trees in secondary memory. Part I: Partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4729324 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adding range restriction capability to dynamic data structures / rank | |||
Normal rank |
Revision as of 15:19, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maintaining range trees is secondary memory. Part II: Lower bounds |
scientific article |
Statements
Maintaining range trees is secondary memory. Part II: Lower bounds (English)
0 references
1990
0 references
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 tansport 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 of partitions. In this way we prove that many of the partitions given in Part I are optimal.
0 references
data structure
0 references
lower bounds for partitions
0 references