Author:
Ishiyama Kazuki,Sadakane Kunihiko
Abstract
AbstractWe first review existing space-efficient data structures for the orthogonal range search problem. Then, we propose two improved data structures, the first of which has better query time complexity than the existing structures and the second of which has better space complexity that matches the information-theoretic lower bound.