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: Jeff Brooks <jeff_brooks_at_nospam.com>
Date: Sat, 05 Jun 2004 21:21:13 GMT
Message-ID: <dPqwc.679894$Ig.382282@pd7tw2no>


Neo wrote:

>>You still owe me $1000.

>
> Because RM solutions (1 and 2) thus far aren't as normalized or
> generic as XDb1's, they fail under a broader scope of data.

I decided to do a quick look at the xdb1 website. I found the following limitations posted on the site:

LIMITATIONS



Single-User - It is not a multi-user database.

RAM Intensive - It loads the entire database into main memory. The maximum database size is appoximately 4 GB with appropriate hardware. The maximum size will increase on 64-bit processors (ie Intel's Itanium).

SQL - None. Data is managed via XDb's GUI, NLI and API. Things can be located via relational expressions.

Security - None currently.

Transactions - None.

Recovery - None. Regular backups, UPS, stable OS, and reliable PC recommended.


Lol, xdb1 is a pathetic toy. No one in their right mind would rely on it for data storage.

Jeff Brooks

p.s. Neo your a fraud, and you owe Hugo $1000. Received on Sat Jun 05 2004 - 16:21:13 CDT

Original text of this message

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