Styjun

Meta programming: Declare a new struct on the fly

What does the "3am" section means in manpages?

The One-Electron Universe postulate is true - what simple change can I make to change the whole universe?

What was required to accept "troll"?

Bob has never been a M before

Why does this part of the Space Shuttle launch pad seem to be floating in air?

Can I Retrieve Email Addresses from BCC?

How can a jailer prevent the Forge Cleric's Artisan's Blessing from being used?

Perfect riffle shuffles

I2C signal and power over long range (10meter cable)

How to prevent YouTube from showing already watched videos?

How can I raise concerns with a new DM about XP splitting?

Installing PowerShell on 32-bit Kali OS fails

How will losing mobility of one hand affect my career as a programmer?

Hostile work environment after whistle-blowing on coworker and our boss. What do I do?

Indicating multiple different modes of speech (fantasy language or telepathy)

Partial sums of primes

Teaching indefinite integrals that require special-casing

The most efficient algorithm to find all possible integer pairs which sum to a given integer

Can a Gentile theist be saved?

How to deal with or prevent idle in the test team?

Is there any significance to the Valyrian Stone vault door of Qarth?

Resetting two CD4017 counters simultaneously, only one resets

Adding empty element to declared container without declaring type of element

Fetching tree-style information

0

I have a table with one field pointing back to itself. This is in order to create a tree-structure.
I need to be able to read this entire tree structure. My query should also include one field to show the "level" in the tree (0-Top, then 1, 2, ...). Eventually I need to sort the records in the visual order (Top Father #1, then all his suns, then Father #2 and his sons, etc.).

I know how to do all this with SQL (recursive WITH statement) to form a recursive select and read the entire tree. But is there a nice way to do it with standard DAL methodology?

Thanks,
Udi

pydal

share|improve this question

asked Mar 21 at 14:26

UdiUdi

1

add a comment | 

0

I have a table with one field pointing back to itself. This is in order to create a tree-structure.
I need to be able to read this entire tree structure. My query should also include one field to show the "level" in the tree (0-Top, then 1, 2, ...). Eventually I need to sort the records in the visual order (Top Father #1, then all his suns, then Father #2 and his sons, etc.).

I know how to do all this with SQL (recursive WITH statement) to form a recursive select and read the entire tree. But is there a nice way to do it with standard DAL methodology?

Thanks,
Udi

pydal

share|improve this question

asked Mar 21 at 14:26

UdiUdi

1

add a comment | 

I have a table with one field pointing back to itself. This is in order to create a tree-structure.
I need to be able to read this entire tree structure. My query should also include one field to show the "level" in the tree (0-Top, then 1, 2, ...). Eventually I need to sort the records in the visual order (Top Father #1, then all his suns, then Father #2 and his sons, etc.).

I know how to do all this with SQL (recursive WITH statement) to form a recursive select and read the entire tree. But is there a nice way to do it with standard DAL methodology?

Thanks,
Udi

pydal

share|improve this question

asked Mar 21 at 14:26

UdiUdi

1

share|improve this question

asked Mar 21 at 14:26

UdiUdi

1

share|improve this question

asked Mar 21 at 14:26

UdiUdi

1

asked Mar 21 at 14:26

UdiUdi

1

asked Mar 21 at 14:26

UdiUdi

1