Hi Joshua,
Thanks for valuable suggestion - I'll certainly try categorizing
the rule set by improving the rule generator. It'd be interesting
to compare the rule engine performance of categorized rules against
the union of all rules.
Best
Chan
I'm considering the Jena Rules as a rule-based programming model
where rules are being discovered and accumulated to grow tens of
thousand, while the fact for inferring new info is only a few
RDF statements. In this case, the rule engine may have to check
each and every rule for the fact to find out the one matching
the statements - which may imply a scaling issue.
Or, should the rules be organized into a set of category, and
the statement is classified first to select the matching rule
set to reduce the rule processing time ?
I'm not sure whether this is appropriate on the [email protected]
list, so I'm only replying on the users list. The forward-chaining
RETE engine, as I understand it, does some optimization in determining
what triples will match to what rules, so the scaling issue might not
be as much of an issue as you suspect. However, it doesn't like it's
too difficult to try out and compare the different approaches (split
up your rules into different categories, then apply reasoning with
just individual categories, and then again with the union of all the
rulesets). Have you run into scaling issues yet?
//JT
