hi all i have a tree/graph of nodes and links inbetween (= explicit m2m), and many users can simultaneusly change nodes/links. i need to get all-reachable-from-x in one query - so i'm saving also all the paths (not just the immediate neibourghs). i think this was called nested-sets or whatever. The question is, (how) can i do that concurency-safe. is version_id a viable/usable solution (can it happen that some poor guy is never able to save his stuff as others always overtake him)?
or, is there another alternative approach to this? ciao svil --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sqlalchemy" group. To post to this group, send email to sqlalchemy@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sqlalchemy?hl=en -~----------~----~----~----~------~----~------~--~---
