Translating with DrWatson… this can take a few seconds the first time.
This is a genuine, complex translation. DrWatson protects commands, error codes, and log output while naturally translating the surrounding text. It’s translated once and saved.
Mark Jamison — — source: Usenet: comp.databases.informix
Good afternoon.
Personally I would use STMT_CACHE. I would also
mention though that there is a small chance of corruption until
10.00.FC6 and above.
As to how to set them up, here is the suggested starting points I always suggest in my performance tuning presentations:
- STMT_CACHE = 2
-
Estimate the number of queries that you expect to get repeated use.
Then Estimate the size of these queries, and multiply by 4K (no greater
than 64 MB to start), this is STMT_CACHE_SIZE
- STMT_CACHE_NUMPOOLS = (Number of CPUVP’s for a start)
- STMT_CACHE_HITS = 1
- STMT_CACHE_NOLIMIT = 1
NOTE: The above are preliminary suggestions, and presume a small number of CPUVP's.
To get a final setting:
monitor STMT_CACHE by looking at
onstat -g ssconstat -g ssc pool
onstat -g spi |grep ssc
and determine if the above is sufficient.
----- Original Message ----
From: "mohitanchlia@gmail.com" <mohitanchlia@gmail.com>
To: informix-list@iiug.org
Sent: Tuesday, August 14, 2007 11:05:00 AM
Subject: STMT_CACHE
Version: 10 FC 4
I was reading about STMT_CACHE to see if this could be used to
increase the performance of repeated queries. But I see lot of people
have filed bugs about it. It appears engine crashes if you try to use
it. So my question is:
1. Do you advise using STMT_CACHE
2. If you do advise then how do I determine STMT_CACHE_NUMPOOL and
STMT_CACHE_SIZE. Also how are these 2 different from each other.
_______________________________________________
Informix-list mailing list
Informix-list@iiug.org
http://www.iiug.org/mailman/listinfo/informix-list
We use strictly necessary cookies to make this site work. With your
consent we’d also use optional cookies for analytics and marketing. You can accept all,
reject all, or choose. Read our Cookie Policy.