Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)

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

From: Neo <neo55592_at_hotmail.com>
Date: 8 Jun 2004 15:00:35 -0700
Message-ID: <4b45d3ad.0406081400.bba6350@posting.google.com>


> > The challenge hasn't change. Understanding of the challenge has. I
> > didn't expect most to understand the entirety of it from the start
> > because of level of genericness and normalization that I desire is
> > uncommon. I expected an iterative process to comparable solution.
>
> Rough translation "I was trying to do wierd ('uncommon') stuff.."

A high degree of normalization (ie to atomic symbols) and genericness (ie to handle any hierarchy) are uncommon, not wierd. Received on Tue Jun 08 2004 - 17:00:35 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US