On 8/5/2010 3:00 PM, Matthew Kitchin (public/usenet) wrote: > On 8/5/2010 1:52 PM, Bowie Bailey wrote: >> My approach to doing something like this would be to have a rule that >> matches the names (however you implement it), and then have the MTA >> check for that particular rule hit and bounce the message if it exists. >> This is the same way you generally use the VBounce plugin. Then do the >> same thing for your "bypass" rule. >> > That is pretty much what I wanted to do. The best way I know to make > Postfix use SA is with Amavisd.
The point being that the score is irrelevant. If the rule hits, the message gets bounced. >> >> Spamassassin can use whatever custom rule you care to come up with. It >> will happily use a regex with hundreds of names listed. The question is >> whether the rule would cause a noticeable slowdown in processing speed. >> The only way to find out is to try it. Using compiled rules would >> probably help here. >> > Thanks. We are looking at roughly 70,000 names and always growing. If > I gave it sufficient hardware, would you expect that to be practical, > or is that totally ridiculous? Any options for a database look up here? I would tend to say that something that large would not be practical. On the other hand, there's no way to really know until you try it. A database lookup is possible, but the problem is determining what to look up. You would have to somehow identify possible names for comparison to the database. -- Bowie
