Re: [rules-dev] Final take on performance .

1) First run your benchmark for at least a minute, before resetting it and starting the time counter: - drl's are probably compiled to java at runtime - hotspot compiling takes a minute to warm up (in -server mode at least) - java has a dog slow initialization phase, but it's the fastest language on the planet once it's warmed up. 2) Your benchmark should at least run 10 minutes, anything less can easily be affected by background tasks 3) After the first benchmark, double your data and check how much longer it takes: that's your scalability. Which program is better? - program A: 10K rows give 10s and 20K rows give 40s - program B: 10K rows give 25s and 20K rows give 50s Program B is better if you speed limit is 100s, because 40K rows will only take 100s on B (do the math yourself for program A). 4) It's not about if and else, it's about nesting for/while loops. Take some use cases where you need to nest for/while loops to be able to implement your rules, then you 'll see a much better Big0 notation for the rule engine (= much better scalability). http://en.wikipedia.org/wiki/Big_O_notation With kind regards, Geoffrey De Smet Harsh Jetly schreef: