[SAtalk] Re: A faster and more scalable matching engine.

2003-11-26 Thread Scott A Crosby
On Wed, 26 Nov 2003 16:39:24 -0500, Pedro Sam <[EMAIL PROTECTED]> writes: > On November 26, 2003 12:58 pm, Kris Deugau wrote: > > Which is next to useless for even 30-40 rules.  You would have to have > > n![1] states for n rules- there is NO way to determine which individual > > rules will trigge

[SAtalk] Re: A faster and more scalable matching engine.

2003-11-26 Thread Scott A Crosby
On Wed, 26 Nov 2003 12:58:19 -0500, Kris Deugau <[EMAIL PROTECTED]> writes: > Pedro Sam wrote: > > hehe, we can give a state to each possible combination of HITS for the > > rules. So if rules 1, 3, 5, 7 hit, we give that a state, and if 2, 4, > > 6, 8 hit, we give it another state, and so on...

[SAtalk] Re: A faster and more scalable matching engine.

2003-11-25 Thread Scott A Crosby
On Tue, 25 Nov 2003 23:04:03 -0500, Pedro Sam <[EMAIL PROTECTED]> writes: > On November 25, 2003 10:31 pm, Alexander Litvinov wrote: > > Heh, it seems it would be nice to make SA scan messages fatser. If I > > undersand your idea correctly, you want not to run regexp one by one, but > > write th

[SAtalk] Re: A faster and more scalable matching engine.

2003-11-25 Thread Alexander Litvinov
> Its relatively straightforward, and has been known for about 30 > years. See the Dragon book, chapter 3. Add a few enhancements and you > get an engine with the same semantics that SA uses, recognizing > overlapping and concurrent patterns at all locations in the input. Thank for point. Its time

[SAtalk] Re: A faster and more scalable matching engine.

2003-11-25 Thread Scott A Crosby
On Wed, 26 Nov 2003 09:31:36 +0600, Alexander Litvinov <[EMAIL PROTECTED]> writes: > Heh, it seems it would be nice to make SA scan messages fatser. If I > undersand your idea correctly, you want not to run regexp one by > one, but write the state machine for all regepes and walk on this > states

[SAtalk] Re: A faster and more scalable matching engine.

2003-11-25 Thread Roger Merchberger
Rumor has it that Scott A Crosby may have mentioned these words: On Tue, 25 Nov 2003 13:11:10 -0500, Roger Merchberger <[EMAIL PROTECTED]> writes: The response was that at a half-second a message is enough. You prolly didn't get many qmailers to respond, then... If it wasn't for SA & spam, my "o

[SAtalk] Re: A faster and more scalable matching engine.

2003-11-25 Thread Scott A Crosby
On Tue, 25 Nov 2003 13:11:10 -0500, Roger Merchberger <[EMAIL PROTECTED]> writes: > At 03:27 11/25/2003 -0600, Scott A Crosby wrote: > >An automata based regexp engine is one that can compile a set of > >regular expressionns down into an automata, then run the automata. The > >advantage this has