Selection of the optimum uniform partition search (Q1069708): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02252517 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1862980841 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Selection of the optimum uniform partition search |
scientific article |
Statements
Selection of the optimum uniform partition search (English)
0 references
1986
0 references
Given an ordered list of records stored on a tape, the binary search minimizes the number of comparisons whereas the sequential search minimizes the distance traveled by the read head. This paper finds the optimum search which minimizes both the number of comparisons and the amount of travel.
0 references
number of comparisons
0 references
amount of travel
0 references
