… be scanned thrice. Wikipedia has a nicely simplified version of the Classic Hash Join algorithm (http://en.wikipedia.org/wiki/Hash_join… workload and 6.6x less times as compared to BKA MySQL 5.6, and 965x less time as compared to BNL MySQL 5.5… time is 3.5x when compared to both MySQL 5.5 and MySQL 5.6. Another interesting thing to note is that for…
Post: Descending indexing and loose index scan
May 9, 2006 By 6 Comments
… actially related to Innodb tables in general – these are features MySQL should get for all storage engines at some point. Descending…_timestamp” field in Wikipedia table structure. Loose index scan – Number of years ago when I just started using MySQL I thought it… values where A>0 instantly jumping to onces have B>6 by using index. It is possibe. So I was shocked…
Post: Sphinx: Going Beyond full text search
July 23, 2007 By 18 Comments
…mysql.com/download/mysql-5.1.html” would match “mysql.com”, “dev.mysql.com”, “dev.mysql.com/download/” and “dev.mysql.com/download/mysql…of links we had to youtube.com wikipedia.org and other top domains was extremely …stored quite significantly, requiring in average of 6 rows for each link and it …
