Andres Freund 211a9721a9 Use cached comparator in ShardIntervalsOverlap(). ... By far the most expensive part of ShardIntervalsOverlap() is computing the function to use to determine overlap. Luckily we already have that computed and cached. The plan time for the query in issue #607 goes from 8764 ms to 2889 ms with this change.		2016-06-16 17:21:19 -07:00
..
multi_explain.c	Add JSON/XML validation to EXPLAIN regression tests and fix issues	2016-05-06 11:30:07 +02:00
multi_join_order.c	Add fast shard pruning path for INSERTs on hash partitioned tables	2016-04-26 11:16:00 +03:00
multi_logical_optimizer.c	Eliminate compile time warnings in multi_logical_optimizer.c	2016-06-10 12:27:12 +03:00
multi_logical_planner.c	Do not copy outer join clauses into WHERE	2016-06-16 16:42:32 -07:00
multi_master_planner.c	Update copyright dates	2016-03-23 17:14:37 -06:00
multi_physical_planner.c	Use cached comparator in ShardIntervalsOverlap().	2016-06-16 17:21:19 -07:00
multi_planner.c	Add EXPLAIN for simple distributed queries	2016-04-30 00:11:02 +02:00
multi_router_planner.c	Change equality operator check for operator expressions	2016-06-06 12:34:16 +03:00