Path: news.easynews.com!easynews!news.he.net!news-hog.berkeley.edu!ucberkeley!newsfeed.stanford.edu!postnews1.google.com!not-for-mail
From: jraustin1@hotmail.com (James)
Newsgroups: comp.databases.theory
Subject: Re: parent/child relationship in the same table.
Date: 17 Nov 2001 21:57:24 -0800
Organization: http://groups.google.com/
Lines: 45
Message-ID: <a6e74506.0111172157.3fce3c6e@posting.google.com>
References: <6768b874.0111152011.22f6087b@posting.google.com> <a6e74506.0111170946.26ce1190@posting.google.com> <gJzJ7.28631$xS6.47168@www.newsranger.com>
NNTP-Posting-Host: 63.172.144.66
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: posting.google.com 1006063045 30494 127.0.0.1 (18 Nov 2001 05:57:25 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: 18 Nov 2001 05:57:25 GMT
Xref: easynews comp.databases.theory:18977
X-Received-Date: Sat, 17 Nov 2001 22:57:34 MST (news.easynews.com)

> >Here is the psuedo code:
> >Call A(0)
> >Function A(par)
> > rs = db.execute("Select * from T_ParChild Where ParId = " & par)
> > While (!rs.EOF)
> >   child = rs("Child")
> >   Print par, child, rs("Data")
> >   Call A(child)
> > Loop
> >End 
> >
> >An oodb can perform the above much faster than relational dbs. In a
> >relational db, the time to resolve the relationships increases with
> >the number of records. In an oodb, the resolution time is not only
> >quicker but constant regardless of number of "records".

> Object folks thinking is frozen in terms of nested loops 
> that user has to write.
If you pulled a marble out of a bag and it was black, you would say
that the remaining marbles in the bag are black. What are your chances
of being correct?

> Object folks thinking is frozen in terms of nested loops 
> that user has to write.
The solution was presented using standard SQL and programming
techniques, which I believe will require nested loops? Can you provide
an alternate practical solution using standard SQL and programming
techniques?

> Not quite. 
Note quite what?
1. oodb is faster at resolving parent/child relationships?
2. resolution time in rdb increases with # of records?
3. resolution time in oodb is constant regardless of # of "recs"?

> A relational database has a concept of "pipelining": 
> it could answer the query above in a single pass through the table.
What exactly is "pipelining"?
Which databases is "pipelining" available in?
Does "pipelining" internally not use any nested loops?
Does "pipelining" disproves any of the 3 points above?
How do I use "pipelining" to create the desired solution?

Would you like to benchmark "pipelining" with XDb which resolves
parent/child relationships at a rate of 100 mil/sec on a 800Mhz PC?