| |
|
RSS Feed - WebSphere MQ Support
|
RSS Feed - Message Broker Support
|
  |
|
| Super fast rule matching... |
« View previous topic :: View next topic » |
| Author |
Message
|
| jdepaul |
 Posted: Tue Jan 23, 2007 9:09 am Post subject: Super fast rule matching... |
 |
|
Newbie
Joined: 23 Jan 2007
Posts: 1
|
Need some ideas from you on how to architect a super fast rule matching engine.
Our system will receive an Event via MQ with some basic information. That information will need to be compared to some Matching Rules definitions. There maybe thousands of these rule definitions and they may change frequently, and the 'matching engine' needs access to these changes as soon as they occur.
The challenge is how to best architect the solution to make this rule matching very fast and efficient. Any architecture examples of this or best practices for this type of problem?
What's the current state of the art for Rule matching - something that is lighting fast - something faster than a DB lookup... |
|
| Back to top |
|
 |
| jefflowrey |
| Posted: Tue Jan 23, 2007 9:40 am Post subject: |
|
|
Grand Poobah
Joined: 16 Oct 2002
Posts: 19981
|
If you're using WMB, I would look into the CEP engine that is Support Pack IA0S.
If you're not using WMB, then you should use a persistent runtime of some sort, to cache the rules, and to receive live updates. For example, use a J2EE App Server and use a database backend only for initialization/shutdown persistance.
Also, examine how "frequently" the rules really need to change.
If I had to do this in a quick and dirty way, I'd use Perl and hash tables and regexps.
_________________
I am *not* the model of the modern major general. |
|
| Back to top |
|
|
|
|
|
| |
|
Page 1 of 1 |
|
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
|
|
|
|
