arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4382cs.DS
收藏

二维近似范围计数的空间复杂度

The Space Complexity of 2-Dimensional Approximate Range Counting

Zhewei Wei, Ke Yi

摘要:

本文研究了具有可加误差的$2$ -维正交范围计数问题.给定从$n\times n$网格绘制的$n$点的集合$P$和误差参数$\eps$,目标是构建数据结构,使得对于任何正交范围$R$,它可以返回具有附加误差$\eps n$的$P\cap R$中的点的数量。这个问题的一个众所周知的解决方案是{ \em $\eps$ -近似},它是一个子集$A\subseteq P$,可以用$A\cap R$中的点数估计$P\cap R$中的点数。已知对于任何关于正交范围的$P$,存在大小$O(\frac{1}{\eps} \log^{2.5} \frac{1}{\eps})$的$\eps$ -近似,并且最佳下限是$Ω(\frac{1}{\eps} \log \frac{1}{\eps})$。$\eps$ -approximation是一个相当有限的数据结构,因为我们不允许在$P$中存储点的坐标以外的任何信息。在本文中,我们将探讨在没有任何数据结构限制的情况下可以实现什么。我们首先描述一个简单的数据结构,它使用$O(\frac{1}{\eps}(\log^2\frac{1} {\eps} + \log n) )$位并回答带有错误$\eps n$的查询。然后,我们证明了一个下界,任何数据结构,回答查询错误$\eps n$必须使用$Ω(\frac{1}{\eps}(\log^2\frac{1} {\eps} + \log n) )$位。我们的下限是信息理论:我们表明,有一个集合的$2^{Ω(n\log n)}$点集与大{ \em联盟组合差异},因此很难区分,除非我们使用$Ω(n\log n)$位。

英文摘要:

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any orthogonal range $R$, it can return the number of points in $P\cap R$ with additive error $\eps n$. A well-known solution for this problem is the {\em $\eps$-approximation}, which is a subset $A\subseteq P$ that can estimate the number of points in $P\cap R$ with the number of points in $A\cap R$. It is known that an $\eps$-approximation of size $O(\frac{1}{\eps} \log^{2.5} \frac{1}{\eps})$ exists for any $P$ with respect to orthogonal ranges, and the best lower bound is $Ω(\frac{1}{\eps} \log \frac{1}{\eps})$. The $\eps$-approximation is a rather restricted data structure, as we are not allowed to store any information other than the coordinates of the points in $P$. In this paper, we explore what can be achieved without any restriction on the data structure. We first describe a simple data structure that uses $O(\frac{1}{\eps}(\log^2\frac{1} {\eps} + \log n) )$ bits and answers queries with error $\eps n$. We then prove a lower bound that any data structure that answers queries with error $\eps n$ must use $Ω(\frac{1}{\eps}(\log^2\frac{1} {\eps} + \log n) )$ bits. Our lower bound is information-theoretic: We show that there is a collection of $2^{Ω(n\log n)}$ point sets with large {\em union combinatorial discrepancy}, and thus are hard to distinguish unless we use $Ω(n\log n)$ bits.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑