1. 01 8月, 1999 6 次提交
  2. 31 7月, 1999 2 次提交
  3. 30 7月, 1999 9 次提交
  4. 29 7月, 1999 6 次提交
  5. 28 7月, 1999 1 次提交
  6. 27 7月, 1999 4 次提交
    • T
      Correct bug in best_innerjoin(): it should check all the · b62fdc13
      Tom Lane 提交于
      rels that the inner path needs to join to, but it was only checking for
      the first one.  Failure could only have been observed with an OR-clause
      that mentions 3 or more tables, and then only if the bogus path was
      actually selected as cheapest ...
      b62fdc13
    • T
      My recent optimizer changes caused a different plan to · 2f30d5a3
      Tom Lane 提交于
      be picked for one of the complex joins in rules test ... leading to
      a different output ordering ...
      2f30d5a3
    • T
      First cut at doing LIKE/regex indexing optimization in · 9e7e29e6
      Tom Lane 提交于
      optimizer rather than parser.  This has many advantages, such as not
      getting fooled by chance uses of operator names ~ and ~~ (the operators
      are identified by OID now), and not creating useless comparison operations
      in contexts where the comparisons will not actually be used as indexquals.
      The new code also recognizes exact-match LIKE and regex patterns, and
      produces an = indexqual instead of >= and <=.
      
      This change does NOT fix the problem with non-ASCII locales: the code
      still doesn't know how to generate an upper bound indexqual for non-ASCII
      collation order.  But it's no worse than before, just the same deficiency
      in a different place...
      
      Also, dike out loc_restrictinfo fields in Plan nodes.  These were doing
      nothing useful in the absence of 'expensive functions' optimization,
      and they took a considerable amount of processing to fill in.
      9e7e29e6
    • B
      Update TODO list. · 434df3fb
      Bruce Momjian 提交于
      434df3fb
  7. 26 7月, 1999 3 次提交
  8. 25 7月, 1999 1 次提交
    • T
      Clean up messy clause-selectivity code in clausesel.c; repair bug · ac4913a0
      Tom Lane 提交于
      identified by Hiroshi (incorrect cost attributed to OR clauses
      after multiple passes through set_rest_selec()).  I think the code
      was trying to allow selectivities of OR subclauses to be passed in
      from outside, but noplace was actually passing any useful data, and
      set_rest_selec() was passing wrong data.
      
      Restructure representation of "indexqual" in IndexPath nodes so that
      it is the same as for indxqual in completed IndexScan nodes: namely,
      a toplevel list with an entry for each pass of the index scan, having
      sublists that are implicitly-ANDed index qual conditions for that pass.
      You don't want to know what the old representation was :-(
      
      Improve documentation of OR-clause indexscan functions.
      
      Remove useless 'notclause' field from RestrictInfo nodes.  (This might
      force an initdb for anyone who has stored rules containing RestrictInfos,
      but I do not think that RestrictInfo ever appears in completed plans.)
      ac4913a0
  9. 23 7月, 1999 3 次提交
  10. 22 7月, 1999 3 次提交
  11. 21 7月, 1999 2 次提交