Re: Relational vs network vs hierarchic databases
Date: Tue, 9 Nov 2004 18:56:58 +0100
Message-ID: <419104f5$0$146$edfadb0f_at_dread11.news.tele.dk>
"Laconic2" <laconic2_at_comcast.net> skrev i en meddelelse
news:LdOdnQiI2PPPaw3cRVn-qQ_at_comcast.com...
>
> "Dan" <guntermann_at_verizon.com> wrote in message
> news:MW5kd.951$2h7.843_at_trnddc03...
>
>> What does orthogonal mean? Does it mean that the intersecting vectors of
>> relational and performance never ever really intersect? No.
>
> In this newsgroup "orthogonal" has come to have a very special meaning.
> It's shorthand for the following:
>
> 'I want to dismiss your arguments as wrong or irrelevant, but I can't
> come
> up with any good way to refute the point you made and I can't show that
> it's not germane, either. So I'll call your point "orthogonal" to my
> point, and continue with my argument as if you had never made your point.
> '
Well, you still owe me (us) to prove your postulate :
"Hierarchical and network databases DO have a performance edge over
relational databases"
The burden of proof is yours, not mine ...
Now, you are free to define "orthogonal" as you like, but you are not free to define what I mean. <g> Received on Tue Nov 09 2004 - 18:56:58 CET