By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
438,756 Members | 1,745 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 438,756 IT Pros & Developers. It's quick & easy.

Tree Strucured data in Db2

P: 1
hi,

Im working on a application that access and evaluates Tree structured data in Db2 tables (into 2 tables). The Tree structure ultimately evaluates to True or False i.e to say each node if it is Secondary node has a AND or OR operator
and if it is a primary node has a business compliant condition to be checked.

Yes, im referring to a COBOL program(business compliant condition).

A business compliant conditions are stored in a table2.
The tree structure is stored in Table1 as rows( each row a node), 2 columns are dedicated to link the rows(nodes) via parent child relationship using numeris values (like [0,1] is a parent of all rows )and an other column to store OR , AND condition for each node.

what is the efficient way of processing the Tree structure(True or False) in Db2 using a COBOL program.

As of now the program is performing using a deep four level looping fetching
nodes(rows) at one level for each loop.

Regards,
Sasi Patha.
Mar 6 '07 #1
Share this question for a faster answer!
Share on Google+

Post your reply

Sign in to post your reply or Sign up for a free account.