Reduce Database Query lookups when generating UUID's

[genusistimelord]

We would like to reduce Database lookups by storing all the UUID upon load and advancement of the Sessions into some sort of Data structure.

Was thinking either

HashSet

• Downside can take lots of Ram if lots of UUID Exist.
• No False Positives or Negatives.
• If a Collision happens becomes whatever the speed of a String to String comparison would be per Amount of Collisions there are.

Counting Bloom Filter

• Uses much less memory as it mathematically stores it as bitsets.
• Can have lots of False Positives the more data there is if the Storage is to small.
• False Positives just means a new UUID has to be generated until it comes out as a Negative or None Existent in the data structure.
• No False Negatives
• No collisions checks Either Exists or Doesnt.