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: 7 Jun 2004 20:17:36 -0700
Message-ID: <4b45d3ad.0406071917.40800466@posting.google.com>


> Respect your promise and pay the guy ...

OK, but first show Neo how to store the equivalent of the following XDb1 script in RM Sol#1 or #2 without redundant data.

color isa thing.
brown isa color.

person isa thing.
john isa person.
john's color is brown.
mary isa person.
mary's color is brown.

Although brown appears three times in the script, XDb1 normalizes the second two by making them references to the first one. There is only one brown in XDb1's db. Using RM#1 or #2, brown is stored three separate times. Received on Mon Jun 07 2004 - 22:17:36 CDT

Original text of this message

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