| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Add Oracle-compatible GREATEST and LEAST functions. Pavel Stehule | Tom Lane | 2005-06-26 | 1 | -2/+18 |
| * | The random selection in function linear() could deliver a value equal to max | Tom Lane | 2005-06-14 | 1 | -12/+25 |
| * | Teach planner to optionally ignore index columns that have an equality | Tom Lane | 2005-06-14 | 1 | -13/+276 |
| * | Change the planner to allow indexscan qualification clauses to use | Tom Lane | 2005-06-13 | 2 | -29/+29 |
| * | Separate predicate-testing code out of indxpath.c, making it a module | Tom Lane | 2005-06-10 | 4 | -676/+698 |
| * | Quick hack to allow the outer query's tuple_fraction to be passed down | Tom Lane | 2005-06-10 | 2 | -3/+46 |
| * | If a LIMIT is applied to a UNION ALL query, plan each UNION arm as | Tom Lane | 2005-06-10 | 2 | -116/+175 |
| * | Revise searching of subplan target lists to use something more efficient | Tom Lane | 2005-06-10 | 1 | -194/+248 |
| * | Simplify the planner's join clause management by storing join clauses | Tom Lane | 2005-06-09 | 12 | -361/+236 |
| * | Marginal hack to avoid spending a lot of time in find_join_rel during | Tom Lane | 2005-06-08 | 4 | -20/+125 |
| * | Nab some low-hanging fruit: replace the planner's base_rel_list and | Tom Lane | 2005-06-06 | 3 | -99/+126 |
| * | Remove planner's private fields from Query struct, and put them into | Tom Lane | 2005-06-05 | 28 | -501/+539 |
| * | Change expandRTE() and ResolveNew() back to taking just the single | Tom Lane | 2005-06-04 | 3 | -27/+27 |
| * | Revise handling of dropped columns in JOIN alias lists to avoid a | Tom Lane | 2005-06-03 | 1 | -4/+2 |
| * | Just noticed that you can't Query-Cancel a long planner run, because | Tom Lane | 2005-06-03 | 1 | -1/+7 |
| * | Add support for FUNCTION RTEs to build_physical_tlist(), so that the | Tom Lane | 2005-05-30 | 2 | -8/+43 |
| * | Skip eval_const_expressions when the query is such that the expression | Tom Lane | 2005-05-30 | 1 | -2/+21 |
| * | Previous fix for "x FULL JOIN y ON true" failed to handle the case | Tom Lane | 2005-05-24 | 1 | -7/+2 |
| * | Avoid redundant relation lock grabs during planning, and make sure | Tom Lane | 2005-05-23 | 3 | -21/+40 |
| * | Teach the planner to remove SubqueryScan nodes from the plan if they | Tom Lane | 2005-05-22 | 6 | -100/+523 |
| * | For some reason access/tupmacs.h has been #including utils/memutils.h, | Tom Lane | 2005-05-06 | 1 | -1/+2 |
| * | Implement sharable row-level locks, and use them for foreign key references | Tom Lane | 2005-04-28 | 5 | -19/+30 |
| * | Avoid rechecking lossy operators twice in a bitmap scan plan. | Tom Lane | 2005-04-25 | 1 | -1/+9 |
| * | While determining the filter clauses for an index scan (either plain | Tom Lane | 2005-04-25 | 2 | -15/+51 |
| * | Replace slightly klugy create_bitmap_restriction() function with a | Tom Lane | 2005-04-25 | 3 | -87/+94 |
| * | Remove support for OR'd indexscans internal to a single IndexScan plan | Tom Lane | 2005-04-25 | 8 | -899/+291 |
| * | Turns out that my recent elimination of the 'redundant' flatten_andors() | Tom Lane | 2005-04-23 | 1 | -66/+157 |
| * | Teach choose_bitmap_and() to actually be choosy --- that is, try to | Tom Lane | 2005-04-23 | 1 | -5/+132 |
| * | Fix bogus EXPLAIN display of rowcount estimates for BitmapAnd and | Tom Lane | 2005-04-23 | 1 | -15/+19 |
| * | First cut at planner support for bitmap index scans. Lots to do yet, | Tom Lane | 2005-04-22 | 9 | -555/+958 |
| * | Rethink original decision to use AND/OR Expr nodes to represent bitmap | Tom Lane | 2005-04-21 | 5 | -166/+215 |
| * | Install some slightly realistic cost estimation for bitmap index scans. | Tom Lane | 2005-04-21 | 5 | -24/+177 |
| * | Don't try to run clauseless index scans on index types that don't support | Tom Lane | 2005-04-20 | 1 | -7/+17 |
| * | Create executor and planner-backend support for decoupled heap and index | Tom Lane | 2005-04-19 | 7 | -43/+666 |
| * | Don't try to constant-fold functions returning RECORD, since the optimizer | Tom Lane | 2005-04-14 | 1 | -1/+12 |
| * | Completion of project to use fixed OIDs for all system catalogs and | Tom Lane | 2005-04-14 | 1 | -3/+2 |
| * | Fix oversight in MIN/MAX optimization: must not return NULL entries | Tom Lane | 2005-04-12 | 2 | -13/+26 |
| * | Add aggsortop column to pg_aggregate, so that MIN/MAX optimization can | Tom Lane | 2005-04-12 | 1 | -16/+1 |
| * | Create the planner mechanism for optimizing simple MIN and MAX queries | Tom Lane | 2005-04-11 | 5 | -196/+860 |
| * | Make constant-folding produce sane output for COALESCE(NULL,NULL), | Tom Lane | 2005-04-10 | 1 | -1/+5 |
| * | Split out into a separate function the code in grouping_planner() that | Tom Lane | 2005-04-10 | 1 | -140/+156 |
| * | Merge Resdom nodes into TargetEntry nodes to simplify code and save a | Tom Lane | 2005-04-06 | 13 | -318/+212 |
| * | In cost_mergejoin, the early-exit effect should not apply to the | Tom Lane | 2005-04-04 | 1 | -7/+12 |
| * | First phase of OUT-parameters project. We can now define and use SQL | Tom Lane | 2005-03-31 | 1 | -3/+2 |
| * | Convert oidvector and int2vector into variable-length arrays. This | Tom Lane | 2005-03-29 | 2 | -23/+26 |
| * | Rethink the order of expression preprocessing: eval_const_expressions | Tom Lane | 2005-03-28 | 5 | -123/+46 |
| * | First steps towards index scans with heap access decoupled from index | Tom Lane | 2005-03-27 | 1 | -3/+2 |
| * | Teach const-expression simplification to simplify boolean equality cases, | Tom Lane | 2005-03-27 | 1 | -1/+57 |
| * | Add a back-link from IndexOptInfo structs to their parent RelOptInfo | Tom Lane | 2005-03-27 | 7 | -126/+84 |
| * | Expand the 'special index operator' machinery to handle special cases | Tom Lane | 2005-03-26 | 3 | -22/+185 |
