As far as the fundamental types go, there's virtually no difference; for the most part, they use the same code. There is one difference: symbols are cached in the "ValueFactory", and cached symbols are likely to do raw equality comparisons a tiny bit faster. Also it's possible that you'll use less memory with symbols, as duplication will be reduced. On the other hand, the overhead of cache lookup is a small performance hit, of course, so in some cases symbols could conceivably be slower.

Overall, it's a wash. I don't think you'll see much of a difference either way.


On Sep 3, 2009, at 5:23 AM, jo wrote:

Hi

I have a large quantity of facts to be matched against a rulebase.

Currently the facts use symbols everywhere but it is causing a headache as some symbols like : cause jess parser exceptions and need special treatment. Strings would solve this but then I wonder if that would not cause a performance hit. ie the question is how does symbol versus string matching compare performance wise in rete?

tx
Joe

---------------------------------------------------------
Ernest Friedman-Hill
Informatics & Decision Sciences, Sandia National Laboratories
PO Box 969, MS 9012, 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].
--------------------------------------------------------------------

Reply via email to