An adaptation of a root finding method to searching ordered disk files revisited

DOI10.1007/BF01952691zbMath0682.68017OpenAlexW2050820614MaRDI QIDQ1824379

Yanyan Li

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

performanceInterpolationPegasus methodFast searchordered and unindexed filespage capacityroot location methodssearching performance

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25) Theory of software (68N99)

Cites Work

• Unnamed Item
• Expected complexity of fast search with uniformly distributed data
• Interpolation search—a log log N search
• The “Pegasus” method for computing the root of an equation

This page was built for publication: An adaptation of a root finding method to searching ordered disk files revisited