> > On the second point, the complexity of the full cascade recursion > with orphan detection makes sense. I suppose I'm interested in any > input from anyone else as to how they are handling these sorts of > operations in many-to-many cases with changing associations.
As i need a history (bitemporal) of all things in my db, i did not have updates nor deletions - all those operations become inserts (of same record with diff. status). For the same reasone, the one-to-many rels have become many-to-many - so u can add new versions on either side of the relation without changing any previous versions - only manipulating the associations inbetween. Then, for the reasons of nested user-transactions and their rollback (see the thread same weeks ago), i ended up updating and deleting these (many-to-many) associations. This "transaction" engine is not 100% working yet, but so far i haven't run into any cascade problems - and i do rely on them to work properly. svil --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sqlalchemy" group. To post to this group, send email to [email protected] 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 -~----------~----~----~----~------~----~------~--~---
