  We study the Fr\'echet queries problem. It is a data structure problem, where
we are given a set $S$ of $n$ polygonal curves and a distance threshold $\rho$.
The data structure should support queries with a polygonal curve $q$ for the
elements of $S$, for which the continuous Fr\'echet distance to $q$ is at most
$\rho$. Afshani and Driemel in 2018 studied this problem for two-dimensional
polygonal curves and gave upper and lower bounds on the space-query time
tradeoff. We study the case that the ambient space of the curves is
one-dimensional and show an intimate connection to the well-studied rectangle
stabbing problem. Here, we are given a set of hyperrectangles as input and a
query with a point $q$ should return all input rectangles that contain this
point. Using known data structures for rectangle stabbing or orthogonal range
searching this directly leads to a data structure with $\mathcal{O}(n \log
^{t-1} n)$ storage and $\mathcal{O}(\log^{t-1} n+k)$ query time, where $k$
denotes the output size and $t$ can be chosen as the maximum number of vertices
of either (a) the stored curves or (b) the query curves. The resulting bounds
improve upon the bounds by Afshani and Driemel in both the storage and query
time. In addition, we show that known lower bounds for rectangle stabbing and
orthogonal range reporting with dimension parameter $d= \lfloor t/2 \rfloor$
can be applied to our problem via reduction. .
