Selection of the optimum uniform partition search

DOI10.1007/BF02252517zbMATH Open0584.68075OpenAlexW1862980841MaRDI QIDQ1069708FDOQ1069708

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

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

zbMATH Keywords

amount of travelnumber of comparisons

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)

Cited In (4)

• The optimum execution order of queries in linear storage
• Binary Search on a Tape
• Monotonicity and efficient computation of optimal dichotomous search
• Operations research applications of dichotomous search

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)