Because I’m busy today, here’s what the announcement looks like (kudos to my colleagues Larry and Daniel for coming up with the following):

MySQL AB is very grateful for our very large Community, and it is important to us to meet and support our users! So we are happy to announce that Colin Charles, MySQL Community Relations Manager, APAC, will be visiting the following locations to meet with MySQL users.

Colin will be prepared to discuss the following with you:

• How to start your own user group
• Review of technical questions and issues
• The MySQL product roadmap and future directions
• MySQL product architecture

You can meet with Colin and speak to him one-on-one during following dates:

• Kuala Lumpur / June 27- July 12, 2007
• Singapore / July 4 - 6th, 2007
• Tokyo / September 11-12th, 2007
• Beijing / September …

Did you know that MySQL supports:

DELETE FROM t1 ORDER BY a;
?

MySQL manual says:
If the ORDER BY clause is specified, the rows are deleted in the order that is specified.

You can use stored functions and subselects there too if you like.

I should start using this feature immediately.

Samsung has announced a new line of 64G SSDs for use in consumer laptops. Nice to see innovation but I REALLY want to see more SSDs in the server space.

I JUST want to use a CHEAP 2-5G SSD for write ahead and binary logs. I just need 1k write ops per second with a SATA interface. Then I could drop them in cheap commodity servers and get a significant performance boost. My disks would still use software RAID 0 (at least until I replace this partitioning) but only store data.

Give me one of these for $50 to $100 and I’ll buy one with ever server.

The fsync’s required for writing to disks on INNODB can really hurt performance. My bet …

Well, it seems many have put up their wishlist for features they would like to see in MySQL so here is my list. These are in no particular order of importance, just as they came to mind :)

1. Online Backup - This is currently being developed and it will make a big difference to many people currently trying to administrate MySQL. We can only hope that it gets done soon and is well tested to avoid any major issues.

2. Standardised HA/Replication - Along similar lines to the consistent online backup is that of consistent high availability, load balancing and replication. No matter what the engine being used, this will allow a consistent method of implementing these features regardless.

read more

Well, it seems many have put up their wishlist for features they would like to see in MySQL so here is my list. These are in no particular order of importance, just as they came to mind :)

1. Online Backup - This is currently being developed and it will make a big difference to many people currently trying to administrate MySQL. We can only hope that it gets done soon and is well tested to avoid any major issues.

2. Standardised HA/Replication - Along similar lines to the consistent online backup is that of consistent high availability, load balancing and replication. No matter what the engine being used, this will allow a consistent method of implementing these features regardless.

read more

I am indeed amazed when I consider how weak my mind is and how prone to error --Rene Descartes

This is not a recommended approach; only explained here so that you can identify it when it presents itself and avoid it.

The following indexes are created on the star schema example shown before:

1. Concatenated index is created on the fact table: sales_transaction (transaction_detail_key, product_key, sales_org_key, calendar_key) - note the difference, compared to the nested join approach where multiple indexes on each foreign key were created
   
2. In addition some indexes may be created on the dimension attributes that are frequently queried: transaction_details (transaction_type), product (SKU), sales_organization …

One cannot have everything the way he would like it --Mark Twain

In the absence of other advanced techniques for star join optimization, nested fact join with dimensions while ensuring that the indexes are used for each dimension join delivers reasonable performance.

The following indexes are created on the star schema example shown:

1. Primary key unique index on surrogate key for each dimension. One index each is created on: calendar (calendar_key), transaction_details (transaction_detail_key), product (product_key), sales_organization (sales_org_key)
2. One index is created for each foreign key on the fact table: sales_transaction (calendar_key), sales_transaction (transaction_detail_key), sales_transaction (product_key), sales_organization (sales_org_key)
3. In addition some indexes may be …

Lookup tables contain, in general, a fixed list of data. This data doesn?t change very often in database business applications. Examples of this data could be a product list, category type, supplier list, state name, zip code, phone area code, etc. In Windows and Internet web business applications, most of these lookup tables are graphically implemented by using ComboBox, ListBox or CheckListBox read-only controls. These controls are loaded with data using two main columns, ID and Name. For example, the USA state table, the ID could be ?CA? and the Name ?California?. Some times, for standard Windows form and Internet web page we need to show data to the end-users from many of these lookup tables. A fast data loading process and defining the main column values for each lookup table is required. In this article I will show you standard lookup data loading procedure and the generic classes object to store and read-only the values of the ID and Name …

Since our goal is to find a tool for profiling while we don't want to change/modify the existing code. So we chooses the Aspect-oriented C tool as the profiling language.

The basic idea is to maintain the profiling code separately, and then use Aspect C to weave the code into the original code automatically. For instance, if we are going to profile the I/O function pread, we can write the below code according Aspect specification. Then every time when pread is called, it will be executed.

#include
long pbxt_profile_pread_access_time;
long pbxt_profile_pread_freq;

int around(): execution(int pread(...)) {
struct timeval start_time;
struct timeval end_time;
gettimeofday(&start_time,NULL);

int val = proceed();

gettimeofday(&end_time,NULL);
…