Re: feature & performance comparison

From: Niall Litchfield <n-litchfield_at_audit-commission.gov.uk>
Date: Mon, 11 Jun 2001 12:39:54 +0100
Message-ID: <3b24ae0b$0$12250$ed9e5944@reading.news.pipex.net>

I tried to and got

The Net.Data ODBC language environment could not allocate the environment handle

oh well try again later. !!

--
Niall Litchfield
Oracle DBA
Audit Commission UK
"Blair Kenneth Adamache" <adamache_at_ca.ibm.com> wrote in message
news:3B243445.E53F5D19_at_ca.ibm.com...


> See appendix M of the SQL Reference, at this page:

>

http://www-4.ibm.com/cgi-bin/db2www/data/db2/udb/winos2unix/support/v7pubs.d
2w/en_main


>

> There are three examples, and it talks about controlling depth. Recursive

 SQL


> has been in DB2 since 1995.

>

> Mark Townsend wrote:

>

> > in article B749727F.1536B%markbtownsend_at_home.com, Mark Townsend at

> > markbtownsend_at_home.com wrote on 6/10/01 6:52 PM:

> >

> > >> WITH RPL (PART, SUBPART, QUANTITY) AS

> > >> (  SELECT ROOT.PART, ROOT.SUBPART, ROOT.QUANTITY

> > >> FROM PARTLIST ROOT

> > >> WHERE ROOT.PART = '01'

> > >> UNION ALL

> > >> SELECT CHILD.PART, CHILD.SUBPART, CHILD.QUANTITY

> > >> FROM RPL PARENT, PARTLIST CHILD

> > >> WHERE  PARENT.SUBPART = CHILD.PART

> > >> )

> > >> SELECT DISTINCT PART, SUBPART, QUANTITY

> > >> FROM RPL

> > >> ORDER BY PART, SUBPART, QUANTITY

> >

> > Hmm - actually, there is more to this than I first saw - presumably this

> > iterates down through all levels of child ? How is this transformed ?

 Can


> > you push predicates into the traversal ? This may be way cool.

>

Received on Mon Jun 11 2001 - 06:39:54 CDT