A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem

Abstract

We suggest an algorithm to solve a two-dimensional interval search problem which is characterised by the memory consumed of order k, the average search time (without the time needed to output the answer) of order √ k, where k is the database size.