Does anybody know a good way to index a large set of strings 
searching for strings that contain a given substring can be done fast
? 

Is there a way to map strings to integers (i.e. indexing without a
tree) so that the substring search can be mapped to examining a range
of these integers and their associated strings . Or is this
theoretically impossible ?