Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Maintaining uniqueness across millions of items

by ChuckularOne (Parson)
on Aug 13, 2004 at 13:03 UTC ( #382649=note: print w/replies, xml ) Need Help??


in reply to Maintaining uniqueness across millions of items

There is always the possibility that you could generate the numbers and create a checkssm that is significantly smaller than 16 digits.

Then you would only have to compare the checksums (and hold them in memory) for uniquness.

The only caveat being that in a list of 600,000,000 keys you, most likely, will have some codes/numbers which are unique but have the same checksum.
  • Comment on Re: Maintaining uniqueness across millions of items

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://382649]
help
Chatterbox?
[haukex]: You can put it in SOPW, but use <readmore> tags
[haukex]: Also you might want to label it "code review"
[haukex]: Unless you have specific questions, in which case SSCCE's are much better
[cbeckley]: Excellent, thank you.
[cbeckley]: CUFP is more appropriate for stuff that's finished^h^h^h^h more advanced state of completeness?

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (9)
As of 2017-03-24 15:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Should Pluto Get Its Planethood Back?



    Results (304 votes). Check out past polls.