I need a data structure that associates multiple "string keys" with a single data set ( kind of like a hash table , but several keys can hash to one node in the table without having to store the data more than once to save space ). What would be a good data structure to implement for this purpose ( I'm thinking of coding a special table that stores pointers to data nodes stored in a different dynamic structure like a list or something )? Thanks for any info..
I think I'm just going to store my structs in an array and then store the array index or struct address in a hash table so that I can match multiple keys to a single data set while using minimum memory. I've seen solutions using multiple hash tables , but I think using a data structure to store the unordered data and a table to find the data items would be easiest ...