Seems like it would be relatively easy to implement inserting into merge
tables. I'd like to be able to at an absolute minimum round-robin
insert, but even better would be something like you can do with
partitioning in oracle.
Baically, something like this:
create table x (...) type=merge union=(a,b,c,d)
partition=a:(where key=val1) partition=b:(where key>val2 and key<val3);
if an insert attempt is made to that can't be partitioned, an error
should be generated, otherwise, it should fall back. In the above
example, it would also round-robin between c,d wherever no partition
criteria didn't match. Whether or not multiple matching partition
criteria should also round-robin is another good question.
It's just an idea, might make merge tables quite a bit more powerful.
-- Nathan
------------------------------------------------------------
Nathan Neulinger EMail: [EMAIL PROTECTED]
University of Missouri - Rolla Phone: (573) 341-4841
CIS - Systems Programming Fax: (573) 341-4216
---------------------------------------------------------------------
Before posting, please check:
http://www.mysql.com/manual.php (the manual)
http://lists.mysql.com/ (the list archive)
To request this thread, e-mail <[EMAIL PROTECTED]>
To unsubscribe, e-mail <[EMAIL PROTECTED]>
Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
