June 19, 2013

Post: Why MySQL could be slow with large tables ?

data fits in memory and when it does not are very different. If you started from in-memory datadata sets. In MySQL single query runs as single thread (with exeption of MySQL Cluster) and MySQL issues IO requests one by one for query

Post: SHOW INNODB STATUS walk through

mysql tables in use 1, locked 0 MySQL thread id 8079, query id 728899 localhost root Sending data select sql_calc_found_rows * fromsearch with hash search. This section shows hash tablehow much data is unflushed inin time. Different lines in SHOW INNODB STATUS populated in different point in

Post: Heikki Tuuri Innodb answers - Part I

from using a binary search on a B-tree node. We could not compare a searchhow your data will compress for the whole table. Among other things compression for data pages and uncompressed index pages can be significantly differentin MySQL 5.1 Q15: How

Post: Heikki Tuuri answers to Innodb questions, Part II

How many read-aheads can be waiting indata access distribution gains will be different ranging fromMySQL bugs opened about multi-core scalability (concurrent queriestable size 10624987, used cells 1, node heap has 1 buffer(s) 0.00 hash searches/s, 15979.01 non-hash searches

Post: Goal driven performance optimization

different response time guidelines for pages which are requested for real humans vs search engine bots (which are often quite different indata in your work. For small and medium size applications you can log all requests to MySQL table

Post: ORDER BY ... LIMIT Performance Optimization

search on many different columns, with worse then perfect selectivity. Various social networking and dating sites are perfect example of such queries SELECT FROM

Comment: Database problems in MySQL/PHP Applications

different with MySQL. Good design will help dictate how many tables are required inin MySQL you might be > better of using several queries than doing complicated ones. Of > course you would rather use IN

Post: Recovery after DROP & CREATE

tables based on values only. For example, if you dropped table actor from db1 and db2 you’ll get two differentsearch for sequence 0×00 0×08 <table_id> 0×01 0×08 and next 8 bytes is index_id. In revision 69 of Percona Data

Post: How Web Services world affect LAMP Stack

…be dealing with two types of requests…category – for example Search Engine bots … would also benefit from ability to submit…which make this difference but I … flags to avoid querying service if …how frequently you can call Web Services. So you might want to cache data on Disk – in files or MySQL tables