Can someone suggest a strategy for solving the following? I am considering Jess as a mechanism for writing queries on a database. The mapping to rules and facts is: * The query is equivalent to a set of one or more rules and patterns. * The facts are stored in a database instead of working/running memory. One algorithm for doing this is a two-stage algorithm: 1. Run something that pulls all the relevant fact data out of the database and turns them into Jess facts. 2. Run the query rule set with the facts from step #1 in running memory. Is there a potentially more efficient way of doing this, or a strategy that uses lazy evaluation? (Lazy evaluation in that only so many facts are pulled out of the database and then filtered at one time.) Thanks. George --------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list. List problems? Notify [EMAIL PROTECTED] ---------------------------------------------------------------------
