Secure Range-Searching Using Copy-And-Recurse

ePrint Report: Secure Range-Searching Using Copy-And-Recurse

Eyal Kushnir, Guy Moshkowich, Hayim Shaul

Range searching is the problem of preprocessing a set of points $P$, such that given a query range $\gamma$ we can efficiently compute some function $f(P\cap\gamma)$. For example, in a 1 dimensional range counting query, $P$ is a set of numbers, $\gamma$ is a segment and we need to count how many numbers in $P$ are in $\gamma$.
In higher dimensions, $P$ is a set of $d$ dimensional …

cap compute copy eprint report function numbers problem query report