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

From: Neo <neo55592_at_hotmail.com>
Date: 6 Jun 2004 14:39:00 -0700
Message-ID: <4b45d3ad.0406061339.384407bb_at_posting.google.com>

> Anything you can do with XDb1 can be done with
> relational database systems...

I haven't stated that RM can't do what XDb1 can (but somethings are more practical in one vs the other).

> and the fact that you don't see this is proof of your lack of insight
> into the theory of database systems.

Why not prove Neo's "lack of insight into db theory" by generating the report for the three thing hierarchy using either RM Sol#1 or #2 without NULLs or redundancy?

---

In measurements made thus far,
RM solutions aren't as generic or normalized as XDb1's.

Small Report Generation Summary (provided by Hugo)

---

Solution Time(ms) Platform Notes

-------------- --------  ----------------- --------------------------
RM#1 SqlSrvr2K  14.3     1.3 Ghz PC
RM#2 SqlSrvr2K  11.0     1.3 Ghz PC
XDb1 4.4.7      16       1.3 Ghz PC        Debug version

Small Report Generation Summary (provided by Neo)

---

Solution Time(ms) Platform Notes

-------------  --------  ----------------- --------------------------
RM#1 SqlSrvr7   65.0     500 Mhz Server
RM#2 SqlSrvr7   68.9     500 Mhz Server
XDb1 4.4.7      16       500 Mhz Server    Debug version
XDb1 4.5.7       1.632   500 Mhz Server
XDb1 4.5.9       6.561   233 MHz PocketPC

Large Report (28,940 rows) Generation Summary (provided by Neo)

---

Solution Time(sec) Platform Notes

-------------  --------  ----------------- --------------------------
RM#5 SqlSrvr7   40.5     500 Mhz Server
XDb1 4.5.7       2.9     500 Mhz Server
XDb1 4.5.9      16.971   233 Mhz PocketPC

Received on Sun Jun 06 2004 - 23:39:00 CEST