Assuming the field-theoretic sense :
You want to find an element $\theta$ such that $\mathbb F_9 = \mathbb F_3(\theta)$.
Since $x^2 = -1$, all the elements of $\mathbb F_9$ are
$$
0,1,2, x,x+1,x+2, 2x,2x+1,2x+2
$$
and you multiply them together with the relation $x^2 +1 = 0$, or $x^2 = 2$. Since every element of $\mathbb F_9$ looks to be a linear polynomial in $x$... how about considering any of the last $6$ elements as primitive elements? If you need help understanding why they are primitive, ask.
Assuming the group-theoretic sense described in my comment for the question :
There is a theorem which tells you that $\mathbb F_9^{\times}$ is a cyclic group, and since $\mathbb Z / 8 \mathbb Z$ has $4$ possible generators under addition (namely $1,3,5,7$), you expect to possibly find $4$ generators of $\mathbb F_9^{\times}$.
$1$, $2$, $x$ and $2x$ obviously don't generate $\mathbb F_9$ because $2^2 = 1$ and $x^2 = 2$, so $\langle 2 \rangle = \{ 1, 2\} \neq \mathbb F_9^{\times}$, $\langle x \rangle = \{ 1, 2, x, 2x \rangle \} \neq \mathbb F_9^{\times}$ and $\langle 2x \rangle = \langle x \rangle$. Therefore, the other $4$ elements, namely $x+1,2x+1, x+2,2x+2$ must all be primitive, because they would correspond to $1,3,5$ and $7$ under an isomorphism $\mathbb F_9^{\times} \cong \mathbb Z / 8 \mathbb Z$ (isomorphisms preserve the order of the elements).
Compute the powers of say, $x+1$ as follows : $(x+1)^2 = x^2 + 2x + 1 = 2 + 2x + 1 = 2x$ using the fact that $x^2 + 1 = 0$, hence $x^2 = 2$. Using your preceding calculations, $$
(x+1)^3 = (x+1)^2 (x+1) = (2x)(x+1) = 2x^2 + 2x = 2x+1,$$
and so on until you have all of them.
Hope that helps,