Re: Relational vs network vs hierarchic databases

From: Dan <guntermann_at_verizon.com>
Date: Tue, 09 Nov 2004 16:58:04 GMT
Message-ID: <wG6kd.397$De1.382@trnddc08>

"Alfredo Novoa" <anovoa_at_ncs.es> wrote in message news:5hs1p0lojg8f6jln7d3km1622s86l98uou_at_4ax.com...
> On Tue, 09 Nov 2004 08:39:10 GMT, "Dan" <guntermann_at_verizon.com>
> wrote:
>
>>Traversing by pointers is very, very fast.
>
> That's why pointers are used to implement RDBMSs.

And bypass indexes? Interesting, Alfredo. I'd like to see more evidence of that if you can point me to it.

>
>>There is not doubt about it.
>>However, there is a huge downside to hardcoding a data model by using
>>pointers and fixed data segments. This should be obvious.
>
> We can hardcode a relational database if we want.

Yes, but is that the same as hardcoding the data model? Of course we can, if we want ;-)
>
>
> Regards
Received on Tue Nov 09 2004 - 10:58:04 CST