Nearest Common Ancestor Report (XDb1's $1000 Challenge)
From: Neo <neo55592_at_hotmail.com>
Date: 16 May 2004 11:27:07 -0700
Message-ID: <4b45d3ad.0405161027.742aa17d_at_posting.google.com>
> Tony wrote: If your analogy holds any water at all (to give you the
> benefit of very large doubt), it suggests that relational theory will do
> just fine for pretty much anything we ever want to do "in the real world".
Date: 16 May 2004 11:27:07 -0700
Message-ID: <4b45d3ad.0405161027.742aa17d_at_posting.google.com>
> Tony wrote: If your analogy holds any water at all (to give you the
> benefit of very large doubt), it suggests that relational theory will do
> just fine for pretty much anything we ever want to do "in the real world".
$1000 to the first person who replicates the equivalent of www.xdb1.com/Example/Ex076.asp using the relational model. To claim the prize, one needs to produce the equivalent Nearest Common Ancestor Report from normalized and NULL-less data and the solution must be as generic, meaning allow the user to create any hierarchy, consisting of different types of things (each type to allow different attributes) and each thing in the hierarchy to have any number of parents. Report generation must not be more than 2X slower than XDb1 on equivalent hardware. Received on Sun May 16 2004 - 20:27:07 CEST