The space complexity of 2-dimensional approximate range counting

Abstract

We study the problem of 2-dimensional orthogonal range counting with additive error. Given a set P of n points drawn from an n x n grid and an error parameter e, the goal is to build a data structure, such that for any orthogonal range R, the data structure can return the number of points in P ∩ R with additive error en. A well-known solution for this problem is the e-approximation. Informally speaking, an e-approximation of P is a subset A ⊆ P that allows us to estimate the number of points in P ∩ R by counting the number of points in A ∩ R. It is known that an e-approximation of size O(1/e log2.5 1/e) exists for any P with respect to orthogonal ranges, and the best lower bound is Ω(1/e log 1/e).The e-approximation is a rather restricted data structure, as we are not allowed to store any information other than the coordinates of a subset of points in P. In this paper, we explore what can be achieved without any restriction on the data structure. We first describe a data structure that uses O(1/e log 1/e log log 1/e log n) bits that answers queries with error en. We then prove a lower bound that any data structure that answers queries with error O(log n) must use Ω(n log n) bits. This lower bound has two consequences: 1) answering queries with error O(log n) is as hard as answering the queries exactly; and 2) our upper bound cannot be improved in general by more than an O(log log 1/e) factor.