I got approval from Ernest to make an announcement. For those who have wondered "which rule is more efficient?" I've implemented a topology cost function for JESS. What it does is look at the number of nodes a fact would visit to trigger a single rule. From that, we can calculate an average cost for the ruleset. I hope people find it useful. I'm releasing the code as public domain, so anyone can use it, distribute it, modify it, or do what ever you want with it.
The source code is available on google code and there is a single jar release. In the SVN repository, there's a Duck Type RETE paper I wrote, which provides an explanation of the topology cost function. http://code.google.com/p/jesscontrib/downloads/list - jar release http://code.google.com/p/jesscontrib/source/browse/#svn/trunk/JessContrib/docs - paper on duck type RETE if anyone has questions about the cost function, feel free to email me directly. peter lin -------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [email protected]' in the BODY of a message to [email protected], NOT to the list (use your own address!) List problems? Notify [email protected]. --------------------------------------------------------------------
