Generally speaking, if you are seeing combinatorial explosions as a result of matching
facts of the same type, then you should be looking to add constraints to your pattern
matches to reduce them.
It’s always possible that there are no additional constraints that you could apply to
achieve this, however, I’m not too sure that anyone can help much without seeing some
examples of your rules.
Steve
On 7 Feb 2014, at 18:35, mattmadhavan <mmadhavan(a)facs.org> wrote:
Hi Stephen,
Thank you very much for your reply! I have another requirement.
Each FACT produces set of records (ArrayList of results). Due to some
constraint I need to keep each array set in the memory as a working fact
because I need to have another rule that will evaluate the array list (for
Each original FACT) and stop processing that particular after certain set of
constraint (combination of records) have reached.
In this situation due to "cartesian' products (n*n) it does becomes
expensive! I am thinking may be I process one FACT at a time as each FACT
produces an ARRAY List which is a FACT it self.
Any ideas please?
Thanks
Matt
--
View this message in context:
http://drools.46999.n3.nabble.com/Batch-processing-large-volume-of-Same-t...
Sent from the Drools: User forum mailing list archive at
Nabble.com.
_______________________________________________
rules-users mailing list
rules-users(a)lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users