Hi, >what everyone wants to do is (well, at least two people so far), is >to take a range of values and distribute them among database clusters >based on the data contained. i.e. all A-E entries go in database 1, >F-H go in database 2, etc. im not familiar with any way to do that >with the typical clustering software available for postgres or mysql. > Ok, in a simple version that doesn't sound too hard to implement. If this only happens on creates (i.e. you don't have to move objects between databases when they're updated) you start with a constructor decorator that binds the object to the appropriate engine.
I'm not sure how querying should work, I guess doing a get by primary key should automatically use the correct database. What about other searches? Do these consult all the databases and merge the results? And what about joins? I guess people are doing this as an optimisation? In that case the app is going to want pretty low-level control, so we should avoid magic in the query system. Speaking of long term plans, though, here's a few thoughts: Optimize parts of SA by recoding in C (e.g. ResultsProxy) Get changes into Python 2.6 to allow overloading of and/or, and to let the equals operator know which way round it was called. Refactor database support so there's more code in ANSI SQL and less in each driver. Provide some XML tools (perhaps this is for a separate library) - an ORXM, object-relational-XML mapper. I'm sure I'll come up with some more as soon as I hit send :-) Take care, Paul --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
