Thanks for the reply. Got it.
On Mon, Oct 18, 2010 at 6:14 PM, Wolfgang Laun <wolfgang.laun(a)gmail.com> wrote:
A simplified explanation is this:
An eval() contains a general Boolean expression; it is, in general,
not possible to re-engineer one or more Contraints from it.
A Constraint relates a fact field to another value. Here, indexing
techniques can be applied, which greatly improve the Rete algorithm.
Also, certain factoring steps (contraction of repeated Constraints
from different left hand sides) are possible with several Constraint
forms.
Rete - even without indexing - is still better than "naive" or "brute
force" searches.
-W
On 18 October 2010 08:47, sumatheja <sumatheja(a)gmail.com> wrote:
> Hi All,
> Is it true that the performance of RETE algorithm gets
> affected if we use "eval" function in the rules conditions?
> Can anyone explain if this is true.
>
> --
> cheers
> _______________________________________________
> rules-users mailing list
> rules-users(a)lists.jboss.org
>
https://lists.jboss.org/mailman/listinfo/rules-users
>
_______________________________________________
rules-users mailing list
rules-users(a)lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users