| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)
Hugo Kornelis wrote:
>
> I took on the challenge. And though hierarchies is not what the relational
> model is best at, I managed to meet all requirements and even outperform
> XDb1. I posted my solution and I claimed my price.
>
> What followed was an increasingly embarrasing display of you trying to
> change the rules, throwing in additional features that XDb1 undoubtedly
> has but that were not mentioned in your challenge, showing your lack of
> knowledge about normalization in the relational model, making claims about
> XDb1 that I could prove untrue by running one simple test and producing
> version after version of XDb1 to fix those bugs and to improve performance
> for generating the NCA report (which is nice to your customers but of no
> relevance at all to the challenge). (I notice you are now on v4.5.3; the
> version I downloaded is v4.4.7, downloaded May 20).
>
> To reiterate: I am NOT making comparisons. I am claiming my $1000 reward.
You go, Hugo!
Neo is completely without integrity ... changing his software in an attempt to prevent you from claiming the prize. Who would buy a database from this man?
-- Lee Fesperman, FirstSQL, Inc. (http://www.firstsql.com) ============================================================== * The Ultimate DBMS is here! * FirstSQL/J Object/Relational DBMS (http://www.firstsql.com)Received on Mon May 31 2004 - 04:18:11 CDT
![]() |
![]() |