Searching Unindexed and Nonuniformly Generated Files in \log \log N Time
From MaRDI portal
Publication:3694705
Recommendations
- Optimizing the search time in models of indexed sequential files with nonuniform distribution of access probabilities
- An adaptation of a root finding method to searching ordered disk files revisited
- Searching and sorting: Classification, transformation, and synthesis. II
- Interpolation-binary search
- Batched search of index sequential files
Cited in
(14)- Some Results for Elementary Operations
- Analysis of recursive batched interpolation search
- New trie data structures which support very fast search operations
- ISB-tree: A new indexing scheme with efficient expected behaviour
- Searching and sorting: Classification, transformation, and synthesis. II
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Dynamic interpolation search revisited
- Improved bounds for finger search on a RAM
- Optimal bounds for the predecessor problem and related problems
- Dynamic interpolation search in \(o(\log\log n)\) time
- An adaptation of a root finding method to searching ordered disk files revisited
- Batched interpolation searching on databases
- Robust variations of interpolation search: An asymptotic analysis
This page was built for publication: Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694705)
