Re: A searchable datastructure for represeting attributes?
From: Niall Litchfield <niall.litchfield_at_btinternet.com>
Date: Sat, 2 Mar 2002 18:53:15 +0000 (UTC)
Message-ID: <a5r72r$bvr$1_at_helle.btinternet.com>
Date: Sat, 2 Mar 2002 18:53:15 +0000 (UTC)
Message-ID: <a5r72r$bvr$1_at_helle.btinternet.com>
"Paul Brewer" <paul_at_paul.brewers.org.uk> wrote in message
news:3c800d6b_1_at_mk-nntp-1.news.uk.worldonline.com...
<snip>
> PMFJI.
>
> I know it's only an example, but in this case wouldn't a check constraint
be
> more efficient (and even nearer to the data)?
>
> Paul
Yes. I'm not sure how well check constraints work given complex logic though which seemed to be implied by the poster. But again yes you are right.
-- Niall Litchfield Oracle DBA Audit Commission UKReceived on Sat Mar 02 2002 - 19:53:15 CET