![]() |
Re: Scam Or Not?
Quote:
|
Re: Scam Or Not?
Quote:
|
Re: Scam Or Not?
Best would be an algorithm which checks new addresses against the list before even putting them in!
Keep N small in the first place, and there's less trouble later. Each submitting machine could keep a filter list of the Last couple submissions so as to cut down on the work the main server has to do. If you had a sorted list, then the duplicate checking would be really easy. Decent insertion routines would help a lot too. Bucket sort to servers holding a piece of the list, then insert using your favorite routine. Get the n^2 work done as it drips in, so you have years to spend on the problem, instead of rushing it just before trying to send emails. |
Re: Scam Or Not?
Actually, if you maintain it as a sorted, no-duplicates list from the start, the total computational effort is actually more along the lines of n*lg(n), which isn't unreasonable, even with a billion entries.
Come to think of it, one could always dump the current list into such an algorythm, and then only use ~ 30,000,000,000 comparisons - roughly eight hours, using the same numbers as the earlier analysis for a single machine. Nevermind; MS has no real excuse. |
All times are GMT -4. The time now is 02:50 AM. |
Powered by vBulletin® Version 3.8.1
Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
Copyright ©1999 - 2025, Shrapnel Games, Inc. - All Rights Reserved.