> What I'd ask is - what are you going to do with the output? What do you > want to achieve? Understanding that might give insight into the best > solution.
the query itself is part of a disseminator returning all memebers of a given collection. the disseminator in turn is used to populate a gui -- a tree with expandable nodes. every node represnts a collection and expanding that node should display the members' names and any additional information that fits to print (all dc data, that is). once the user clicks an individual item, the object has to be retrieved, but if most of the information is available already those clicks will decrease. + coll1 + coll 2 - coll 3 |_ item 1 (subject, title, ...) |_ item 2 (subject, title, ...) |_ item 3 (subject, title, ...) +coll 4 to minimize the number of requests necessary i try to get most if not all information in one go. though it's going to be processed by java eventually i try to put most of the burden on fedora -- if iTQL itself does not support merging the results the xsl used by the disseminator could be adapted. thanks again for the pointers. ------------------------------------------------------------------------- This SF.Net email is sponsored by the Moblin Your Move Developer's challenge Build the coolest Linux based applications with Moblin SDK & win great prizes Grand prize is a trip for two to an Open Source event anywhere in the world http://moblin-contest.org/redirect.php?banner_id=100&url=/ _______________________________________________ Fedora-commons-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/fedora-commons-users
