Log Buffer #125: A Carnival of the Vanities for DBAs
Nov 28, 2008 / By David Edwards
It’s time for another exciting installment of Log Buffer, the weekly review of database blogs.
On Prestidigitation of Oracle, Bradd Piontek gets it started with the second in a series on migration to 10g—Making the database a safer place, reviewing security-related changes in 10gR2. (Full disclosure: I should also mention that Bradd is now sitting just a few desks away from me.)
The ORACLE-BASE Blog has a dynamic duo of articles—one each on installing Oracle 11.1 and installing Fedora 10. (I’m a little late mentioning it, but this item is a fine complement to Augusto Bott’s latest article: Installing Oracle 11gR1 on Ubuntu 8.10 Intrepid Ibex).
Asif Momen offered dynamic sampling myths dispelled, which he introduces thus: “There are couple of myths associated with Dynamic Sampling . . . i) Default number of blocks sampled are 32 in Oracle 10g and ii) Tables having less than 32 blocks are not considered by the optimizer for dynamic sampling.” Dispel away, Asif!
Messed-up apps and DBs. Writes Sam Hughes on Things Of Interest, “ . . . by far the least plainly bigoted [objections to gay marriage] . . . are the bureaucratic ones. To be blunt, the systems aren’t set up to handle it.” The article is Gay marriage: the database engineering perspective. It’s perceptive, funny, and yes—there’s lots of comment.
The Fake Amelia posts about cracking the Tokutek contest with MySQL 5.1: “[Tokutek] is a company that makes a proprietary engine for MySQL. In their contest, they claim that it takes 20 days to insert 1 billion records into a InnoDB table, and that MyISAM is not even up to the task. In their example, InnoDB inserts 404 rows per second and MyISAM died after a few days of inserting 93 rows per second. . . . It looks farfetched to me. Surely you can do better than that.” Which Fake Amelia herself does, with help from 5.1.
Peter Zaitsev of the MySQL Performance Blog has a little contest too—a Thanksgiving challenge: How to detect replication context. (But Thanksgiving was more than a month ago!) Unlike Totutek, Peter doesn’t offer a Starbucks gift card as a prize, but on the other hand, he doesn’t offer a Starbucks gift card as a prize.
Another new offering is the MySQL Query Analyzer. It’s been well reviewed by MySQL bloggers. Baron Schwartz of xaprb has covered it himself, but now he posits an alternative to the MySQL Query Analyzer, based on the Percona patchset and mysqlsla, and tabulates the similarities and differences in the capabilities of the two approaches.
Mark Leith also had something to say about MySQL Query Analyzer vs. Perconaâ€™s patches: “Everybody [is] saying that this functionality should be implemented in the server, or that the better way to do this is to use these patches . . . Well guess what people – what does that give you, other than some more details on you queries? More I/O. Whatâ€™s bad on a database server? More I/O.”
A couple technical posts. Kristian Nielsen contributed his analysis of selecting rows holding group-wise maximum of a field.
Stewart Smith offers his and Brian Aker’s illustration of vertical scaling. MySQL-HA indeed!
In the land of SQL Server, Kalen Delaney poses a question to his audience: What happens when you change a column in an index from a key column to an included column? (Again, no Starbucks gift card.)
If I’ve missed any blogs you’ve enjoyed from this last week, please add them to the comments. And don’t forget to get in touch with me if you’d like to publish an edition of Log Buffer on your own weblog.
Till next time!