Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)

Let me try to put this simply for you, "Neo":

You're demanding that the relational equivalent of your example be implemented using specific techniques that you use internally in XDb1 to save space in the in-RAM database. In other words, to meet your (revised) challenge, one would have to use an open source database system, and rewrite it to handle data storage in a new and different way. You don't really believe anyone will do this, do you?

If you had been genuine, you would have accepted that the relational implementation be done within the framework of the relational model, using a standard relational database system the way it's intended to be used, instead of trying to force your opponents to use their tools wrongly.

If you had been competent, you would have understood the above, and you would further have understood that while your XDb1 is a different way of doing a small subset of what other database systems do, it does not add anything new. Anything you can do with XDb1 can be done with relational database systems, and the fact that you don't see this is proof of your lack of insight into the theory of database systems.

My final word on this to you: you owe Hugo $1000.

My final word on this to the others: I think everybody should stop responding to "Neo" now. He's no longer entertaining, and there is no way he is ever going to shut up, grow up, pay up, or learn anything.

-tih

-- 
Tom Ivar Helbekkmo, Senior System Administrator, EUnet Norway
www.eunet.no  T: +47-22092958 M: +47-93013940 F: +47-22092901