How to store "infixes"

I need to store all possible infixes of words (and their location) to be able to quickly make queries.

(eg. anus -> a, n, u, s, an, nu, us, anu, nus, anus)

Problem is, even with small files, if you store "infix->list of positions", the index gets really really really large (obviously).

I have been trying to think of a data structure to reduce storage needed, but... I failed. Any ideas?

>>4
You doubt suffix trees use less space than brute force storage? I wasn't able to verify, but I'm pretty sure it's O(input size). Your algorithm is O(2^(input size)). Suffix trees win.