On Aug 21, 2009, at 9:39 AM, Lucia Masola wrote:
I working with Java and Jess 7.1p2. I've wrote rules that involves searching relationships between facts in order to obtain all the relatives of a fact. It involves searching recursively. It all seems to work fine in smaller examples, but when i tried with a database of approximately 15.000 facts i couldn't get an answer. Is there any restriction regarding scalability??
Jess is a programming language, and as with any programming language, it's easy to write programs that scale badly with data size. If you've got a large collection of data all of the same type, and some rules that do nothing but "join" those data with themselves, then you can easily create rules that scale as the square of the size of the data, or even worse. There's a question about this in the FAQ; see here:
http://www.jessrules.com/jess/FAQ.shtml#Q12 --------------------------------------------------------- Ernest Friedman-Hill Informatics & Decision Sciences Phone: (925) 294-2154 Sandia National Labs PO Box 969, MS 9012 [email protected] Livermore, CA 94550 http://www.jessrules.com -------------------------------------------------------------------- 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]. --------------------------------------------------------------------
