Re: Sql to Relational Algebra

From: Bob Badour <bbadour_at_golden.net>
Date: Sat, 20 Sep 2003 21:26:48 -0400
Message-ID: <Wm8bb.357$be7.34636888_at_mantis.golden.net>


<Joseph>; <joseph_at_aracnet.com> wrote in message news:bkib9o23t7_at_enews3.newsguy.com...
> "Bob Badour" <bbadour_at_golden.net> writes:
>
> >The latter advantage is particularly important for usability. Years ago,
> >Fabian Pascal did a comparison of different SQL dbms's ability to provide
> >good, consistent performance for logically equivalent queries using
> >different redundant elements of SQL. If I recall correctly, the dbms that
> >could achieve the fastest performance would also deliver the worst
> >performance depending on how the user expressed the query. Ingres
delivered
> >the most consistent performance because, at the time, it supported SQL by
> >translating it to QUEL.
>
> The pros and cons of SQL vs. quel are strictly in terms of human factors
of
> expressing queries.

With all due respect, you are ignoring the fact that Quel is a less redundant language and how this impacts performance optimization. Received on Sun Sep 21 2003 - 03:26:48 CEST

Original text of this message