The traditional way to handle it is to have a central database the assigns numbers and increments a counter. The problem with is the central database may be inaccessible. Further the central database becomes a crucial bottleneck.
You can also have an in-ram unique number server with a thread safe access.
I suggest a partially decentralised variant in my Unique Number Server Student Project.
Another way to do it is to use large pseudorandom numbers and count on the improbability of two numbers being picked the same. This technique is fully decentralised approach. No communication between number assigners is needed. This is how java.util. UUID works.
| You can get the freshest copy of this page from: | or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror) | |
| http://mindprod.com/jgloss/unique.html | J:\mindprod\jgloss\unique.html | |
![]() | ||
| Canadian Mind Products | ||
| mindprod.com IP:[65.110.21.43] | ||
| view Blog | Your face IP:[38.107.191.109] | |
| Feedback | You are visitor number 6,128. | |