Re: A Normalization Question

"VHarris001" <vharris001_at_aol.com> wrote in message news:20040709085018.29796.00001158_at_mb-m18.aol.com...
> Alan wrote:
>
> >Unfortunately, I don't agree that his implemenation is practical. You
wind
> >up storing nothing but pointers to data. This would be a nightmare when
it
> >comes time to extract the data. Imagine trying to debug a report. Then
there
> >is the question of data entry. How would the system know what data was
> >already entered? Ex: A user goes to enter the string "Brown" as a car
color.
> >The system would need to check to see if that string was already
enetered.
> >The overhead would be enormous.
> >
>
>
> Why? As I recall, an index will locate a specific instance in a file of 1
> billion records in just 30 looks. How much overhead would be required to
> perform 30 iterations to verify the existance of 'brown' versus whatever
the
> alternative is?
>
> V Harris

Because it would not be looking up the string "brown". It has to look up the b, the r, the o, etc. Now imagine having to look up something long, like an address. Received on Fri Jul 09 2004 - 16:10:43 CEST