Optimizing Queries in OODBs (was: Dreaming About Redesigning SQL)

From: Mikito Harakiri <mikharakiri_at_iahu.com>
Date: Fri, 10 Oct 2003 11:08:23 -0700
Message-ID: <DIChb.34$qu2.112_at_news.oracle.com>


"Patrick K. O'Brien" <pobrien_at_orbtech.com> wrote in message news:m265ixf4fe.fsf_at_orbtech.com...
> lauri.pietarinen_at_atbusiness.com (Lauri Pietarinen) writes:
> You wouldn't necessarily *have to*. PyPerSyst does not yet have a
> declarative query capability. But if you add an index, the same
> procedural code will now make use of that index (or rather, the
> procedural code is calling methods of objects that are smart enough to
> look for indexes to optimize themselves without requiring any changes
> in application code).
>
> I only point this out becase critics of object databases really need
> to improve their understanding of the capabilities of object languages
> and object databases. They just aren't as inflexible as some pundits
> would like to claim.

I just went through simple stupidity test for Object Relational yesterday. Yes, Object Relational folks are not totally dumb, their stuff doesn't have *obvious* flaws. Therefore, yes it seems possible in principle to optimize queries in Object Extensions to SQL, and maybe in even OQL as well.

The problem is that they raise complexity so significatly that it is extremely challenging for the optimizer to catch up. Note, that sql optimization is struggling to solve all problems in "simple" area of "flat" relations. Or, to put it in other words, how large is optimization team in your little PyPerSyst? Received on Fri Oct 10 2003 - 20:08:23 CEST

Original text of this message