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

From: Neo <>
Date: 10 Jun 2004 12:44:24 -0700
Message-ID: <>

> > Thus far RM Sol#1 and #2 fail to meet the challenge because, they
> ...can not run fast enough to keep up with the changing challenge.

The challenge was and still is ...

"$1000 to the first person who replicates the equivalent of 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 Thu Jun 10 2004 - 21:44:24 CEST

Original text of this message