1. 18 3月, 2004 2 次提交
    • T
      Reimplement CASE val WHEN compval1 THEN ... WHEN compval2 THEN ... END · 55f7c330
      Tom Lane 提交于
      so that the 'val' is computed only once, per recent discussion.  The
      speedup is not much when 'val' is just a simple variable, but could be
      significant for larger expressions.  More importantly this avoids issues
      with multiple evaluations of a volatile 'val', and it allows the CASE
      expression to be reverse-listed in its original form by ruleutils.c.
      55f7c330
    • B
      Modify: · 8c702ea7
      Bruce Momjian 提交于
      < * Order duplicate index entries by tid for faster heap lookups
      > * Order duplicate index entries on creation by tid for faster heap lookups
      8c702ea7
  2. 17 3月, 2004 3 次提交
    • B
      Document SPI_push() and SPI_pop(). · d245b6bd
      Bruce Momjian 提交于
      d245b6bd
    • T
      Replace the switching function ExecEvalExpr() with a macro that jumps · c1352052
      Tom Lane 提交于
      directly to the appropriate per-node execution function, using a function
      pointer stored by ExecInitExpr.  This speeds things up by eliminating one
      level of function call.  The function-pointer technique also enables further
      small improvements such as only making one-time tests once (and then
      changing the function pointer).  Overall this seems to gain about 10%
      on evaluation of simple expressions, which isn't earthshaking but seems
      a worthwhile gain for a relatively small hack.  Per recent discussion
      on pghackers.
      c1352052
    • B
      Add: · 2c7e4734
      Bruce Momjian 提交于
      > * Allow pg_dumpall to use non-text output formats
      >
      2c7e4734
  3. 16 3月, 2004 10 次提交
  4. 15 3月, 2004 10 次提交
  5. 14 3月, 2004 10 次提交
  6. 13 3月, 2004 2 次提交
  7. 12 3月, 2004 3 次提交