1. 13 Jan, 2012 3 commits
  2. 12 Jan, 2012 1 commit
  3. 11 Jan, 2012 1 commit
  4. 10 Jan, 2012 2 commits
  5. 09 Jan, 2012 1 commit
  6. 08 Jan, 2012 2 commits
  7. 07 Jan, 2012 1 commit
  8. 06 Jan, 2012 1 commit
  9. 05 Jan, 2012 2 commits
  10. 06 Jan, 2012 1 commit
    • Vladislav Vaintroub's avatar
      Fix some failing tests on Windows · d2617343
      Vladislav Vaintroub authored
      - ensure that mtr supressions table is flushed before doing controlled crash and restart
      - use DBUG_SUICIDE() rather than abort() in partition tests - avoids a crash message/warning
      - disable  perfschema all_instances test on Windows- there are  legitimate reasons  for output to be different on  Unix (some different threads, some different locks), the differences are expected to grow in the future, e.g with threadpool.
      d2617343
  11. 04 Jan, 2012 1 commit
  12. 03 Jan, 2012 1 commit
    • Igor Babaev's avatar
      Fixed LP bug #910083. · cd55894a
      Igor Babaev authored
      The patch for bug 685411 erroneously removed a call of engine->set_thd()
      from Item_subselect::fix_fields().
      cd55894a
  13. 02 Jan, 2012 4 commits
  14. 30 Dec, 2011 5 commits
  15. 29 Dec, 2011 1 commit
  16. 28 Dec, 2011 3 commits
  17. 27 Dec, 2011 6 commits
  18. 26 Dec, 2011 3 commits
  19. 24 Dec, 2011 1 commit
    • Igor Babaev's avatar
      Back-ported the patch of the mysql-5.6 code line that · 2b1f0b87
      Igor Babaev authored
      fixed several defects in the greedy optimization:
      
      1) The greedy optimizer calculated the 'compare-cost' (CPU-cost)
         for iterating over the partial plan result at each level in
         the query plan as 'record_count / (double) TIME_FOR_COMPARE'
      
         This cost was only used locally for 'best' calculation at each
         level, and *not* accumulated into the total cost for the query plan.
      
         This fix added the 'CPU-cost' of processing 'current_record_count'
         records at each level to 'current_read_time' *before* it is used as
         'accumulated cost' argument to recursive 
         best_extension_by_limited_search() calls. This ensured that the
         cost of a huge join-fanout early in the QEP was correctly
         reflected in the cost of the final QEP.
      
         To get identical cost for a 'best' optimized query and a
         straight_join with the same join order, the same change was also
         applied to optimize_straight_join() and get_partial_join_cost()
      
      2) Furthermore to get equal cost for 'best' optimized query and a
         straight_join the new code substrcated the same '0.001' in
         optimize_straight_join() as it had been already done in
         best_extension_by_limited_search()
      
      3) When best_extension_by_limited_search() aggregated the 'best' plan a
         plan was 'best' by the check :
      
         'if ((search_depth == 1) || (current_read_time < join->best_read))'
      
         The term '(search_depth == 1' incorrectly caused a new best plan to be
         collected whenever the specified 'search_depth' was reached - even if
         this partial query plan was more expensive than what we had already
         found.
      2b1f0b87