Ah yes this is a good point thank you. Can probably just using a hashing function and perform a quick lookup to avoid collisions as you suggest. If there is a collision what would you suggest is the best way to deal with it? Anything else we should keep in mind when doing this?