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

"Mikito Harakiri" <mikharakiri_at_iahu.com> wrote in message news:<DIChb.34$qu2.112_at_news.oracle.com>...

 [ snip ]

> 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?

  Which bit of object relational drew your ire?

  Extensible domains adds some complexity, but it also simplifies some   stuff. Queries over UDTs/UDFs works pretty good in Postgres. Check out the   Sequoia 2000 and Bucky benchmarks.

  References and table inheritance make a lot harder.

    KR

                     Pb