June 19, 2013

Post: The MySQL optimizer, the OS cache, and sequential versus random I/O

group by fact.col1 There are indexes on all the columns in all the ways you’d expect: all the dimension columns…I/O. So now you know why one join order is faster than the other. But why didn’t …MySQL optimizer were right and each of these had to go to disk, our STRAIGHT_JOIN plan would take more than

Post: 3 ways MySQL uses indexes

BY B – in these cases getting data in sorting form would require a bit more than simple range scan in the BTREE and MySQL…to couple of columns index can be simply much smaller than the data which is one of the reason…using index for group by but I think they can be pretty much looked as one of these 3…

Post: Realtime stats to pay attention to in Percona XtraDB Cluster and Galera

…run, but this one is focused on ‘…columns in the cluster section, and it’s important to understand that this tool only currently connections to a single node (by… under the Flow group.  This is wsrep_cert…more than that coming in. Our replication is performing well, because the Flow control columns

Post: Implementing efficient counters with MySQL

… you choose replication (rather than partitioning) as your scaling … some cases there are more counters then there really… say “id” and “counter” columns. Using separate table …to run rather complicated group by query ? Sure it does… insert into one and process and truncate another. MySQL offers atomic…

Post: Heikki Tuuri Innodb answers - Part I

… potentially compresses the database more than just prefix compression….table scan is only one of replacement policy optimizations… was some work done by DIKU students improving…group commit again. HT: I do not think so. Sergei Golubchik serialized the MySQL…used if the columns are the first columns in …

Post: A case for MariaDB's Hash Joins

MySQL 5.5 but takes slightly more time as compared to BKA algorithm of MySQL…> ’1996-05-01′ GROUP BY o_orderkey ORDER BY num_items DESC LIMIT 10; …than Hash Join when you are joining two tables on a PK column such that both tables are read in PK order. One

Post: Shard-Query adds parallelism to queries

… thread. MySQL never takes advantage of more than a …BY RANGE COLUMNS(FlightDate) (PARTITION p2 VALUES LESS THAN (’1988-01-01′) ENGINE = InnoDB, PARTITION p3 VALUES LESS THANmore like OLTP. Instead of getting one big chunk of data in one… ’2007-12-31′ GROUP BY carrier ORDER BY 2 DESC; .tblGenFixed…

Comment: Database problems in MySQL/PHP Applications

more space thanby multiple columnsgroup tables by certain logic, such as > you do with directories to group files. I think this makes a lot of > sense. Sometimes groupingMySQL you might be > better of using several queries than doing complicated ones. Of > course you would rather use IN() than

Post: InnoDB Full-text Search in MySQL 5.6: Part 2, The Queries!

one of these stopword tables, it simply mentions the table engine and the columnBY 3 DESC LIMIT 5; …MySQL” – odds are that an article which has 10 instances of “MySQL” might be more desirable to us thangroup the search terms as a single phrase: With 5.5: mysql

Post: Database access Optimization in Web Applications.

GROUP BY Queries and Sort Queries – SELECT name,descr FROM titles ORDER BYBY rank query is such – adding index on rank columnone query it is better than doing so by several queries, assuming this query would not need to analyze much more