|
This running entry collects key announcements related to Oracle's Acquisition of Sun; some from the Jan 27th event, some from companion webcasts, and some later announcements. The main theme of the acquisition is "We're Changing the Way you Buy, Run and Manage Business Systems". |
Main Entry Points:
I’ve been looking over the documentation lately and trying to find ways to improve the installation experience for new users. That said, I’ve written a short but useful description of the easiest way to install all of the Perl and PHP requirements for Kontrollbase. You can find it here: http://kontrollsoft.com/kontrollbase/userguide/installation-install_overview.php#simple – or in the Installation [...]
I know the biggest part of my fanclub already booked tickets for my upcoming presentations, but the other 2 might want to check their calendars to see if they aren't missing out on the good stuff :)
Next Sunday I`ll giving a shortish overview of MySQL HA alternatives in the MySQL and Friends devroom at Fosdem.
March will bring me to Manchester again for the UKUUG Spring conference where I`ll be giving a longer version of that presentation with a strong focus on integrating with PaceMaker, and automating the whole boostrap procedure of a HA setup.
Early may will bring me to Ede in the Netherlands where I`ll be telling the crowds at the NLUUG spring conference, about their new fancy jobtitles, as …
[Read more]This post is inspired by a discussion with John Didion:
Is there any way to optimize the query for overlapping ranges in MySQL if both ranges are dynamic?
I have two tables, each with integer range columns (specified as
LineString), and I want to find rows that overlap.
No matter what I try, the query planner never uses any indexes.
This question addresses a well-known problem of efficient searching for the intersecting intervals. The queries that deal with it require ability to search for the intervals (stored in two distinct columns) containing a constant scalar value.
Plain B-Tree indexes used by most databases do
not speed up the queries like that. However,
MySQL supports SPATIAL indexes that
can index …
In a previous post I talked about how to take a classic SQL
anti-pattern (storing lists as CSV in a single field), normalize
it, and how to write queries for it.
There are two other ways to handle sets of values: The built in
SET column type, and using a INT/BIGINT column as a
bitfield.
The mysql set data type provides a convenient way
of working with a list of values, where each field could
represent multiple simultaneous values. It's really just a
wrapper around bitmask operations -- it lest you work with them
using text as well as numerical values.
But how do they perform? My quick test showed that aside from a
couple edge cases, they all preformed about the same speed. In
fact it was surprising to me to see that the bitmask type queries
were really not that much faster than the more normalised table …
It is now possible to use the UNIX_TIMESTAMP() function in
partitioning expressions using TIMESTAMP columns.
MySQL 5.1.43 can be downloaded from
http://dev.mysql.com/downloads/
For example, it now possible to create a partitioned table such
as this one : [...]
The 2nd of February, 0900GMT/1000CET I will have a webinar on
Cluster Performance Tuning for people located in EMEA
timezone.
For more information and registration:
http://mysql.com/news-and-events/web-seminars/display-480.html
In addition to what is mentioned in the Agenda I will also
present numbers on typical operations, how to design requests,
explain how the optimizer works with MySQL Cluster etc etc.
See you there!
-johan
Last month at the Boston MySQL User Group, I went through the meanings of INNER, LEFT/RIGHT OUTER, CROSS, NATURAL joins, how to do a FULL OUTER JOIN in MySQL, and what STRAIGHT_JOIN means. I also explained how to recognize when you want those types of joins, and best practices for the semantics of writing joins and design patterns. Subqueries were explained in this session, and some examples of how to think differently so that you end up writing JOINs instead of subqueries. The slides (slightly different from the slides in the video — due to error correction) can be found at http://technocation.org/files/doc/2010_01MySQLJoins.pdf.
Here’s the video:
A new version of MySQL Cluster 7.1 beta has been released and is
available from our ftp directory at
mysql-5.1.41-ndb-7.1.1-beta.tgz
The Cluster 7.1 beta code base is identical to Cluster 7.0 GA.
While maintaining our GA quality throughout all core
functionalities we added two of the most requested enhancements
as independed features to 7.1 beta:
ndb$info
ndb$info makes cluster status and statistics available on SQL
level. Log into the MySQL Server and simply use SQL to retrieve
configuration details, memory status or the node status and
uptime:
mysql> SELECT * FROM ndbinfo.nodes; …[Read more]
This post has no content related to databases, liek MySQL, tuning
or anything like that. It is a precursor to such a posting
though. And for those of you who have been around a bit and was
reading Byte magazine in the good old days, featuring Jerry
Pournelles "Computing at Chaos Manor" column, you might
recognize a Chaos Manor style pattern here, along the lines
of:
- A new printer is bought.
- It doesn't work on the laptop.
- The main computer is hooked up to the printer instead.
- Allowing network access fails as the gateway between the laptop
and the main computer doesn't work.
- Gateway is reconfigured, but now the sons computer has no
network access.
- While fixing the sons computer network access, the kitchen sink
suddenly gets clogged.
- When the kitchen sink is fixed, the laptop suddenly burst into
flames.
etc. etc.
…