Analysis of recursive batched interpolation search

DOI10.1007/BF01932130zbMATH Open0692.68037OpenAlexW2078504921MaRDI QIDQ583891FDOQ583891

Authors: Sheau-Dong Lang 

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

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

Recommendations

• Batched interpolation searching on databases
• Interpolation-binary search
• Batched search of index sequential files
• Sequential vs. Binary Batched Searching
• Dynamic interpolation search in \(o(\log\log n)\) time

zbMATH Keywords

complexitybinary searchbatched searching algorithminterpolation- search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Interpolation-binary search
• Expected complexity of fast search with uniformly distributed data
• Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
• Sequential vs. Binary Batched Searching
• Interpolation search—a log log N search

Cited In (4)

• Dynamic Interpolation Search Revisited
• Batched interpolation searching on databases
• Batched search of index sequential files
• Sequential vs. Binary Batched Searching

This page was built for publication: Analysis of recursive batched interpolation search

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