Batched interpolation searching on databases

DOI10.1016/0020-0255(89)90013-3zbMATH Open0682.68077OpenAlexW2065717486MaRDI QIDQ1824401FDOQ1824401

Authors: Jianzhong Li, Harry K. T. Wong, Doron Rotem 

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90013-3

Recommendations

• Analysis of recursive batched interpolation search
• Interpolation-binary search
• Batched searching in database organizations
• Batched search of index sequential files
• scientific article; zbMATH DE number 4062609

zbMATH Keywords

databasedistributedinterpolation search algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Cites Work

• Approximating block accesses in database organizations
• Interpolation-binary search
• Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
• Interpolation search—a log log N search
• An algorithmic and complexity analysis of interpolation search
• Title not available (Why is that?)

Cited In (7)

• Batched searching in database organizations
• Analysis of recursive batched interpolation search
• Fast search algorithms for look‐up tables
• Efficient aggregation algorithms on very large compressed data warehouses
• An adaptation of a root finding method to searching ordered disk files revisited
• Batched search of index sequential files
• Sequential vs. Binary Batched Searching

This page was built for publication: Batched interpolation searching on databases

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