[AccessD] the dreaded n-recursive parts explosion (BOM)query...again

I will look at this and hope to mine some useful stuff from it.

-----Original Message-----
From: accessd-bounces at databaseadvisors.com
[mailto:accessd-bounces at databaseadvisors.com] On Behalf Of Gustav Brock
Sent: July 20, 2005 9:24 AM
To: accessd at databaseadvisors.com
Subject: Re: [AccessD] the dreaded n-recursive parts explosion
(BOM)query...again

Hi Bruce

Have in mind that DAO may be superior regarding speed and ease of
maintenance (no "special" fields needed, just the parent ID, thus no
smart SQL).

Lookup "Tree shaped reports" from 2002-06-02 in the archive.
Maybe my function RecursiveLookup() can guide you ...

This function uses a static recordset and Seek and runs blazingly
fast.

/gustav



>>> Bruce.Bruen at railcorp.nsw.gov.au 07/20 1:16 am >>>
Hi folks,
 
I thought I had got over this one years ago and can't find the SQL
query template someone (Lembit???) here kindly supplied last time.  
 
But it has come back to get me again, so....
 
Does someone have a "template" query to return all the parts in an
n-level parts explosion, preferably in binary-tree pre-order order.
* all components, subcomponents and parts are held in the same table, 
* it is a one way tree - i.e. parts that are used in multiple
assemblies appear multiple times in the table (i.e.i.e. the pkey for the
tree table is not the SKU)

-- 
AccessD mailing list
AccessD at databaseadvisors.com
http://databaseadvisors.com/mailman/listinfo/accessd
Website: http://www.databaseadvisors.com