Sylvain Leroux <[email protected]> writes: > If you use adjacency lists, recursion is the answer. But is not > directly supported by Derby. As Rick Hillegas suggested, one solution > would be to encapsulate the recursive part or your query in a custom > table function (written in Java). I've never done that, so if you do, > I would find of great benefice if you post your solution on the > mailing list (or the wiki)!
The SQL standard has recursive queries these days (WITH RECURSIVE, cf. SQL 2003, vol 2, section 7.13 <query expression>), sadly not supported by Derby. Do we we have a volunteer to implement it? ;-) Dag
