On Sep 9, 2005, at 11:23 PM, Marc G. Fournier wrote:
The case is where I just want to check that a value being inserted
is one of a few possible values, with that list of values rarely
(if ever) changing, so havng a 'flexible list' REFERENCED seems
relatively overkill ...
That's what I
On Sat, Sep 10, 2005 at 01:03:03AM -0300, Marc G. Fournier wrote:
> On Fri, 9 Sep 2005, Michael Fuhr wrote:
> >INSERT INTO test_check SELECT 1 FROM generate_series(1, 10);
> >INSERT 0 10
> >Time: 3492.344 ms
> >
> >INSERT INTO test_fk SELECT 1 FROM generate_series(1, 10);
> >INSERT 0 10
On Fri, 9 Sep 2005, Michael Fuhr wrote:
On Sat, Sep 10, 2005 at 12:23:19AM -0300, Marc G. Fournier wrote:
Which is faster, where the list involved is fixed? My thought is that
since it doesn't have to check a seperate table, the CHECK itself should
be the faster of the two, but I can't find an
On Sat, Sep 10, 2005 at 12:23:19AM -0300, Marc G. Fournier wrote:
> Which is faster, where the list involved is fixed? My thought is that
> since it doesn't have to check a seperate table, the CHECK itself should
> be the faster of the two, but I can't find anything that seems to validate
> tha
Which is faster, where the list involved is fixed? My thought is that
since it doesn't have to check a seperate table, the CHECK itself should
be the faster of the two, but I can't find anything that seems to validate
that theory ...
The case is where I just want to check that a value being
