Re: newby (very) question on XML DB theory

From: Mikito Harakiri <>
Date: Wed, 14 Apr 2004 14:59:09 -0700
Message-ID: <LEifc.42$>

"Jan Hidders" <> wrote in message news:Eyhfc.71539$
> //Courses[starts-with(.//_at_instructor_last_name, "VAN")]
> I've taught this stuff to CS students and non-CS students. I have no
> idea why you think this would be too difficult for the latter. I do,
> however, have an idea why a non-declarative query language that requires
> programming if queries get a little bit more difficult would be
> problematic for them.

May I suggest that XQuery is more complex than SQL? Because it's less pure:-?

Take outer join for, example. As purity is broken (by allowing nulls into result set) selection and outer join operation don't commute anymore. It took me some time (with usenet help) to realize that

select * from t1 left join t2 on and

is different from

select * from t1 left join t2 on where

for example. This is never an issue with ordinary joins and selections. Simplicity of the underlying algebra is the key for the query language success. (Hmm, what about SQL?) Received on Wed Apr 14 2004 - 23:59:09 CEST

Original text of this message