We introduce the first index that can be built in $o(n)$ time for a text of length $n$, and can also be queried in $o(q)$ time for a pattern of length $q$. On an alphabet of size $��$, our index uses $O(n\sqrt{\log n\log��})$ bits, is built in $O(n((\log\log n)^2+\sqrt{\log��})/\sqrt{\log_��n})$ deterministic time, and computes the number $\mathrm{occ}$ of occurrences of the pattern in time $O(q/\log_��n+\log n)$. Each such occurrence can then be found in $O(\sqrt{\log n\log��})$ time. By slightly increasing the space and construction time, to $O(n(\sqrt{\log n\log��}+ \log��\log^\varepsilon n))$ and $O(n\log^{3/2}��/\log^{1/2-\varepsilon} n)$, respectively, for any constant $0