8 commits

Author	SHA1	Message	Date
sergefp@mysql.com	1f21ac3cd3	Fix for BUG#8579 (failing test case): Allow small differences in #rows estimate in test results	2005-02-22 18:30:44 +03:00
hf@deer.(none)	b94a482ee9	Precision Math implementation	2005-02-09 02:50:45 +04:00
sergefp@mysql.com	6303ca7efa	Fixes in opt_range.cc: ROR plan choice code ... * Removed unused parameters * Fixed several cost calculation errors in ror_intersect_add * Better code structure for ror_intersect_add and get_best_ror_intersect	2005-01-17 00:18:19 +03:00
monty@mysql.com	86508ad969	Fix test results	2004-12-06 01:34:19 +02:00
sergefp@mysql.com	838eaec709	Fix and testcase for BUG#4984 ... The crash is eliminated but still it is weird/inefficent that ROR-intersection is used when performing updates in empty table.	2004-08-11 16:40:46 +04:00
sergefp@mysql.com	dff98a8ef7	* New index_merge EXPLAIN output format ... * Fixed a problem with wrong query results for partially covering keys in ROR-index_merge * ROR-intersection retrieval plan choice algorithm now uses less disk IO - and properly processes clustered PK range scans * Fixed several minor range optimizer problems * Added more comments * Code cleanup	2004-05-29 02:04:01 +04:00
sergefp@mysql.com	8b4ea8337f	Post-merge fixes (code review fixes will follow)	2004-05-13 04:50:54 +04:00
sergefp@mysql.com	a46d7542c9	This is first cset for WL#1394 "Optimize index merge when all involved index ranges include only values with equal keys" ... The main idea is to exploit the fact that key scans for "key=const" return ordered sequences of rowids.	2004-05-13 01:38:40 +04:00