June 19, 2013

Post: MySQL Query Patterns, Optimized - Webinar questions followup

query optimizer and see how easy it is?  ;-)  Generative grammars like SQL can produce an infinite variety of  queries.  The query optimizer analyzes queries formultiple columns in a compound index, then the order would matter, and it would have to match the order of columns in

Post: A case for MariaDB's Hash Joins

table built on it is greater than the join_buffer_size, then multiple hash tables would be created. Forcolumn In this test we can clearly see that Hash Join gives a lot of reduction in query time. The reduction in query time for

Post: Shard-Query turbo charges Infobright community edition (ICE)

table tables to the staging tables, omitting the dimension columns from the projection, instead replacing them with the dimension keys: selectmultiple files (for each shard, for later loading) or it can load files directly, in parallel, to multiple hosts. Shard-Query will execute queries in

Post: Flexviews - part 3 - improving query performance using materialized views

table changelogs which are created by FlexCDC. The refresh algorithm computes changes in multiple transactions. After each transaction it must wait forcolumn. It is used to prevent wide innodb primary keys on the MV. mysql> select

Post: How To Test Your Upgrades - pt-upgrade

SELECT queries against multiple MySQL servers and reports on how each type of queryquery times. # Query 7: ID 0x76323E2525BA457C at byte 0 _______________________________ # Found 441 differences in 510 samples: # checksums 0 # column counts 0 # column types 0 # query

Post: Using Flexviews - part one, introduction to materialized views

table. It has columns and rows, just like a database table, but it is temporary in nature, usually existing only in memory forin time, essentially a consistent snapshot of the query result. It is not possible to create multiple different tables

Post: Why MySQL could be slow with large tables ?

… rows/sec. Note multiple drives do not really help a lot as we’re speaking about single thread/query here. So difference… table with over 30 millions of rows. “val” column in this table has 10000 distinct value, so range 1..100 selects about 1% of the table. The times for full table scan vs…

Comment: Database problems in MySQL/PHP Applications

multiple tables gives some very important benefits – your data > becomes managable, your ALTER TABLE or OPTIMIZE TABLE > now locks small table forquery. For example you can do: > SELECT id FROM users WHERE featured=1; > Now populate List for IN on your PHP application: > SELECT

Post: InnoDB Full-text Search in MySQL 5.6 (part 1)

column that you defined for the underlying table, or it can be a sequence value generated by InnoDB when the tableTABLE multiple times if we’ve had a lot of changes to the table. This all sounds pretty good, in…) SELECT reverse(full_name), details FROM dir_test_innodb WHERE id < 500000; Query OK,…

Post: Quickly preloading Innodb tables in the buffer pool

… relatively well (though can be slow for fragmented tables) but it does not preload indexes in memory neither it does externally stored objects… such query per index is enough even if it is multiple column index. To fetch BLOB/TEXT externally stored columns you can use similar query: SELECT