subject:"\[rules\-users\] Memory Consumption with 5000 Rules"

[rules-users] Memory Consumption with 5000 Rules

2010-12-09 Thread thomas . polzin

Dear all, My setup includes about 5000 rules with the following pattern: rule 1 when ( $c_0 : CFRO( fi.co == 1, su.co == P, c.co == C) or $c_0 : CFRO( fi.co == 2, su.co == P, c.co == C) or $c_0 : CFRO( fi.co == 3, su.co == P, c.co == C) or $c_0 : CFRO( fi.co == 4, su.co == P, c.co == C) or $c_0

Re: [rules-users] Memory Consumption with 5000 Rules

2010-12-09 Thread Mark Proctor

Each 'or' will generate a rule, so that's more like 50K rules. Mark On 09/12/2010 22:08, thomas.pol...@gmail.com wrote: Dear all, My setup includes about 5000 rules with the following pattern: rule 1 when ( $c_0 : CFRO( fi.co == 1, su.co == P, c.co == C) or $c_0 : CFRO( fi.co == 2, su.co ==

Re: [rules-users] Memory Consumption with 5000 Rules

2010-12-09 Thread Jared Davis

I would try two different layouts and see what happens to memory usage. I think the rules that use in will be faster than the standard matches implementation. rule 1.in when $c_0 : CFRO( fi.co in (1,2,3,4,5), su.co == P, c.co == C) then Bcf fact = new Bcf (); fact.setC( 123); insert( fact);