So I was hacking around in the MySQL server code this weekend, and took at look at the implementation of the UUID() function.Instead of using Theodore Tso uuid library, which now ships by default on all Linux and MacOS machines (I dont know about BSD and Solaris), we implemented our own from scratch. With a global mutex lock on generation, which will utterly blow on a multicore machine.So I pulled down a branch of the server source code from Launchpad, and then branched it again twice locally. In those two branches, I replaced the implementation with a call to libuuid.so uuid_generate_random() and with a call to libuuid.so uuid_generate_time(). Then I built all three trees, and benchmarked 10 million calls to UUID (SELECT BENCHMARK(10000000,UUID());).I was surprised at the results.
implementationtime in seconds
built-in1.95
uuid_generate_random()96.76
uuid_generate_time()70.62
How is the builtin one so fast?!S...
Content suppressed by ://URLFAN, for full article visit source
SolidDB for MySQL orphaned by IBMFrom: arjen-lentz.livejournal.com
Post Date: 2008-03-04 14:58:51
Hmm... understandable from a pure business perspective, but not the best outcome for this engine. It didn’t have the highest of profiles and buzz, but I know that users were trying it and liked some of its features. Orphaned open source code tends to not go anywhere, unless someone else picks it up and runs it as a project. See the original announcement with links/refs below:Update on solidDB for MySQLBy: Dhiren Patel (dhiren) - 2008-03-03 12:12Dear Community Members, As you may k...
more 3 strikesFrom: krisbuytaert.be
Post Date: 2008-03-04 14:04:26
I’d call this the 3rd strike and everybody knows what happens next
Marc Fleury has some good answers to the most clueless industry reporter around, starting with:
Spring is touting itself as a JBoss replacement. Smart PR, but false. Spring is a development framework comprising wrappers and dependency injection on top of Hibernate and Tomcat runtimes, both developed, and monetized by JBoss.
You can drop some balls, no one can keep track of what’s going on in Open Source land, ...
more Tradeoffs: Updates versus Range QueriesFrom: blogs.tokutek.com
Post Date: 2008-03-04 11:14:00
Sorry for the delay, now on to range queries and lenient updates. Let’s call them queries and updates, for short. So far, I’ve shown that B-trees (and any of a number of other data structures) are very far from the “tight bound.” I’ll say a bound is a tight if it’s a lower bound and you can come up with data structure that matches it.
So how do we match the bandwidth bound for queries and updates? I already mentioned in passing how to do this, bu...
more 
Websites mentioned in article
Buzz Words mentioned in article:
How popular is fallenpegasus.livejournal.com?
