Mark Proctor wrote:
In Drools 3.0 we did not need to shadow as we hade a more complicated algorithm that maintained more references allowing for asymetrical behaviour - however I couldn't get the algorithm to perform with Jess like performance and it used a lot more memory. I dropped Drools 4.0 back to how Jess does it with shadow facts and symmetrical assert/retract. For Drools 5.0 I have re-written the algorithm and have managed to get asymettrical behaviour with actual performance increases, not losses. This is now in a branch and I hope to merge into trunk soon.
Could you elaborate a bit on this algorithm (and/or that of Drools 3.0)? Or is there some reference where I can find information about the general ideas behind it (other than digging into the source code)?
Thanks, Peter
begin:vcard fn:Peter Van Weert n:Van Weert;Peter org:K.U.Leuven;Computer Science adr:room 01.08;;Celestijnenlaan 200A;Heverlee;;3001;Belgium email;internet:[EMAIL PROTECTED] title:DTAI (Declarative Languages and Artificial Intelligence) tel;work:+ 32 16 327064 x-mozilla-html:TRUE url:http://www.cs.kuleuven.be/~petervw/ version:2.1 end:vcard
_______________________________________________ rules-users mailing list rules-users@lists.jboss.org https://lists.jboss.org/mailman/listinfo/rules-users
