On Dec 21, 2006, at 9:56 AM, Simon Riggs wrote:
On Thu, 2006-12-21 at 09:36 -0500, Matthew O'Connor wrote:
Richard Huxton wrote:
Simon Riggs wrote:
- improve RI check perf by caching small, static tables in each
backend
- apply index filter conditions on index scan to avoid heap lookup
For fkey checks against a basically static table could you get
away with
just checking the index and not the table?
I'm not sure that would fly, there is always the possibility it could
change, I think the ENUMs patch will solve this performance problem.
Not using SQL Standard syntax it won't.
I'd be happier if it worked with DOMAINs and happier still if we
can get
it to optimise just bare datatypes. My objective is to tune a database
without needing to reload any of the tables and to ensure that RI is
effective in both directions (from referencing and referenced tables).
Perhaps there's a way to make that happen...
A thought I've had is that if we allowed users to control the
thresholds for compressing and toasting a field, we could essentially
produce the effects of small, static 'lookup' tables by just using a
text field in the base table and forcing it to always toast (you'd
need a check constraint, too). If we detected that situation, we
might be able to optimize for it...
As for the other items, it would be useful to have some idea what
kind of performance gains are to be had... maybe it would be
worthwhile to put together quick-hack patches just for performance
testing.
--
Jim Nasby [EMAIL PROTECTED]
EnterpriseDB http://enterprisedb.com 512.569.9461 (cell)
---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
