On Thu, May 22, 2008 at 1:56 PM, GTXY20 <[EMAIL PROTECTED]> wrote:
> With respect to a potentially large dictionary object can you suggest
> efficient ways of handling memory when working with large dictionary
> objects?
Consider using a database. The public value can just be the primary
key of th
Thanks all;
Basically I will be given an address list of about 50 million address lines
- this will boil down to approximately 15 million unique people in the list
using SSN as the reference for the primary key. I was concerned that by
using random I would eventually have duplicate values for diff
On Thu, May 22, 2008 at 12:14 PM, GTXY20 <[EMAIL PROTECTED]> wrote:
> Hello all,
>
> I will be dealing with an address list where I might have the following:
>
> Name SSN
> John 1
> John 1
> Jane 2
> Jill 3
>
> What I need to do is parse the address list and then cre
On Thu, May 22, 2008 at 12:17 PM, taserian <[EMAIL PROTECTED]> wrote:
> so that I can relate it back to the original SSN when needed.
Oh! Oops! I didn't clearly understand this sentence the first time.
Yes, you want to learn about cryptography. Google for Bruce Schneier -
one of the world's forem
Oops! Maybe it works better with reply to all:
You're looking for a completely random 9 digit number that you can't
derive the name from?
I don't know that anything would really be more or less secure than
simply using random.
>>> import random
>>> random.randrange(1,9)
988559585
On Thu, May 22, 2008 at 12:14 PM, GTXY20 <[EMAIL PROTECTED]> wrote:
> Hello all,
>
> I will be dealing with an address list where I might have the following:
>
> Name SSN
> John 1
> John 1
> Jane 2
> Jill 3
>
> What I need to do is parse the address list and then cre
Hello all,
I will be dealing with an address list where I might have the following:
Name SSN
John 1
John 1
Jane 2
Jill 3
What I need to do is parse the address list and then create a unique random
unidentifiable value for the SSN field like so:
Name SSNrandomvalu
