Batched interpolation searching on databases
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3359771 (Why is no real title available?)
- An algorithmic and complexity analysis of interpolation search
- Approximating block accesses in database organizations
- Interpolation search—a log log N search
- Interpolation-binary search
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
Cited in
(7)- Sequential vs. Binary Batched Searching
- 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
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)