Selection of the optimum uniform partition search

DOI10.1007/BF02252517MaRDI QIDQ1069708zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1986

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02252517

zbMATH Keywords

amount of travelnumber of comparisons

Mathematics Subject Classification ID

Searching and sorting (68P10)

Review text

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.

Recommendations

• Binary Search on a Tape
• scientific article; zbMATH DE number 5697691
• Optimizing the search time in models of indexed sequential files with nonuniform distribution of access probabilities
• Search in an Ordered Array Having Variable Probe Cost
• Sequential vs. Binary Batched Searching

Cited in

(5)

• Monotonicity and efficient computation of optimal dichotomous search
• Operations research applications of dichotomous search
• Binary Search on a Tape
• scientific article; zbMATH DE number 1322968 (Why is no real title available?)
• The optimum execution order of queries in linear storage

This page was built for publication: Selection of the optimum uniform partition search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069708)