OO fans bashing Joins

Title: OO fans bashing Joins

In chapter 31 of Bertrand Meyer's OOSC2 (a popular OO text), Meyer bashes RDBMS "Joins" and says that OO/OODBMS do the equivalent faster.

For snippets and my comments, please see:

http://geocities.com/tablizer/meyer1.htm#ch31

Other OO fans seem to be saying the same thing. Is there a famous test that said OO is faster than Joins? Where is this perception coming from?

Like I say in the above link, if OO systems have found a way to "join" faster, then why don't RDBMS's copy that technique instead of staying slow?

Is it because RDBMS vendors don't wish do deviate from B-Tree indexing to use pointer lists instead (internally)?

Is there some truth to this rumor, or is it just more annoying OO propoganda? (I am not an OO fan, as you may have guessed :-)

Thanks, -tmind-

Sent via Deja.com http://www.deja.com/
Before you buy. Received on Mon Mar 06 2000 - 00:00:00 CET