2 problems

For integers $n$ and $u$ with $u=n^{1+o(1)}$, and a prime $p>u$, define…

Does there exist a family of data structures which, for every binary text $T\in\{0,1\}^n$, uses $O(n)$ bits of space and answers suffix-array access queries…