Thanks a lot, I will get back to you with some more questions ;-) -jb
On Thu, May 7, 2009 at 12:04 AM, Wolfgang Laun <[email protected]>wrote: > Jess will "handle memory" just like any well written Java program does. > > You should not load facts that aren't necessary for your rules. > > The way the rule emgine forms the "in-memory network" depends on your > rules. > > The "best practice" of writing good rules depends on your application. But, > as a general guideline, think of rules as a way of narrowing down the number > of decisions you have to take: the faster you do that, the less work you > have to do. > > -W > > > > On Wed, May 6, 2009 at 2:15 PM, Johnny Bravo <[email protected]>wrote: > >> Hi Jess Users, >> >> I am new to rule based system and little confused about few things, Please >> help me out in clearing my doubts. >> We have decided to use Jess in our application to find out the changes in >> working memory as well as to process the changed data. The facts in the >> memory will be loaded from flat files by converting data (all relevant data >> will be loaded as a form of templates). >> Just for the precautionary measures I want to know how effectively Jess >> can handle memory or is it up to programmer to take care of writing rules >> and not loading un-necessary facts? >> I want to know how Jess rule engine forms the in memory network or graph? >> what should be the preferred way for fast matching of rules conditions? >> What are the best practices to write efficient rules and queries to use >> memory effectively? >> >> Thanks in advance, >> -jb >> >> >
