A question I recently saw on Stack Overflow titled Faster way to delete matching [database] rows? prompted me to organize my thoughts and observations on the subject and quickly jot them down here.
Here is the brief description of the task: say, you have 2 MySQL tables a and b. The tables contain the same type of data, for example log entries. Now you want to delete all or a subset of the entries in table a that exist in table b.
Solutions Suggested By Others
DELETE FROM a WHERE EXISTS (SELECT b.id FROM b WHERE b.id = a.id);
So the Comcast installer just left, and I'm sitting here in my new house, on the floor, with no furniture, testing how fast the internet actually is (because who really cares about other stuff?). Comcast Blast is supposed to be 16mbps down and 1mbps up (2 if you're extremely lucky). I'm still collecting my jaw all over the floor though, because these are the speed test results:
That's a 3 mbit per second upload = 375 KB/s. Wow, Comcast, just wow. I know there are many people having complaints about service but after being a customer for 8 years, I really am happy with everything. Blows the puny DSL away….