question

[publicocean0]

hi i have a set of unordered strings (in general elements)
i might create a hashcode string or integer identifying uniquely this set.I addition i have to create a fast function given a string(element) returns fastly all sets containing this element. Have you a idea if there is a fast adt for it? maybe a Trie?
Ideally i think a tree where every parent node contains a hashcode based on children.