Simon Riggs
606c0123d6
Reduce btree scan overhead for < and > strategies
...
For <, <=, > and >= strategies, mark the first scan key
as already matched if scanning in an appropriate direction.
If index tuple contains no nulls we can skip the first
re-check for each tuple.
Author: Rajeev Rastogi
Reviewer: Haribabu Kommi
Rework of the code and comments by Simon Riggs
2014-11-18 10:24:55 +00:00
..
2014-11-18 10:24:55 +00:00
2014-08-13 22:40:48 -04:00
2014-11-15 01:19:49 -03:00
2014-11-15 01:19:49 -03:00
2014-05-06 12:12:18 -04:00
2014-05-06 12:12:18 -04:00
2014-11-10 15:21:09 -05:00
2014-07-10 15:01:43 -04:00
2014-05-06 12:12:18 -04:00
2014-11-05 17:12:23 -05:00
2014-05-06 12:12:18 -04:00
2014-11-10 15:21:09 -05:00
2014-11-07 17:34:36 -05:00
2014-11-15 01:19:39 -03:00
2014-10-25 11:11:39 +02:00
2014-05-06 12:12:18 -04:00
2014-08-13 22:40:48 -04:00
2014-05-06 12:12:18 -04:00
2014-11-06 13:55:36 +02:00
2014-11-14 17:05:17 -05:00
2014-05-06 12:12:18 -04:00
2014-11-13 20:02:37 +02:00
2014-05-06 12:12:18 -04:00
2014-03-12 17:51:30 +02:00
2014-11-17 11:23:35 -03:00
2012-10-07 21:52:43 -04:00
2014-09-25 23:49:05 +02:00
2014-08-06 16:11:43 -04:00
2014-05-06 12:12:18 -04:00
2014-04-02 17:11:24 -04:00
2014-09-10 17:21:50 +02:00
2014-10-02 16:52:21 +02:00
2014-10-23 08:18:45 -04:00
2012-10-07 21:52:43 -04:00
2012-10-07 21:52:43 -04:00
2014-11-18 09:55:05 +02:00
2014-10-25 11:11:39 +02:00
2014-09-25 23:49:05 +02:00
2014-05-08 12:42:56 -04:00
2014-01-07 16:05:30 -05:00
2014-06-04 12:09:45 +09:00
2014-01-07 16:05:30 -05:00
2014-10-16 15:22:10 -04:00
2014-10-17 22:55:20 -04:00
2014-05-06 12:12:18 -04:00
2014-01-07 16:05:30 -05:00
2014-07-07 19:39:42 +09:00
2014-01-07 16:05:30 -05:00
2014-01-07 16:05:30 -05:00