Morten Laustsen

Learn More
We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching.Our range counting structure uses O(N log<inf>2</inf> N) space and answers queries using O(log<inf>B</inf> N) memory transfers, where B is the block size of any memory level in a(More)
There exist several models of how a computer works putting their emphases on varying aspects of the computer. This paper uses the random access model (RAM), external memory model and cache oblivious model to describe three similar algorithms based on the same general idea to support orthogonal range counting queries in O(log 2 n) time, O(log B N) I/Os and(More)
  • 1