Skip to content
Snippets Groups Projects
  1. Jun 09, 2006
    • Bruce Momjian's avatar
      Add URL. · 1a1326d6
      Bruce Momjian authored
      < 	  the insert.
      > 	  the insert.
      > 	  http://archives.postgresql.org/pgsql-patches/2005-07/msg00568.php
      1a1326d6
    • Bruce Momjian's avatar
      Update: · fa23204c
      Bruce Momjian authored
      < * Add SQL99 WITH RECURSIVE (hierarchical) queries to SELECT
      > * Add SQL:2003 WITH RECURSIVE (hierarchical) queries to SELECT
      fa23204c
    • Bruce Momjian's avatar
      Remove: · 2f12903e
      Bruce Momjian authored
      < * Rename some /contrib modules from pg* to pg_*
      2f12903e
    • Tom Lane's avatar
      Fix bootstrap.c so that database startup process and bgwriter properly release · 1358466a
      Tom Lane authored
      LWLocks during a panic exit.  This avoids the possible self-deadlock pointed
      out by Qingqing Zhou.  Also, I noted that an error during LoadFreeSpaceMap()
      or BuildFlatFiles() would result in exit(0) which would leave the postmaster
      thinking all is well.  Added a critical section to ensure such errors don't
      allow startup to proceed.
      
      Backpatched to 8.1.  The 8.0 code is a bit different and I'm not sure if the
      problem exists there; given we've not seen this reported from the field, I'm
      going to be conservative about backpatching any further.
      1358466a
  2. Jun 08, 2006
  3. Jun 07, 2006
  4. Jun 06, 2006
  5. Jun 05, 2006
    • Tom Lane's avatar
      Remove extremely old, incomplete, broken example code. · ff0ac57d
      Tom Lane authored
      Per my proposal a few days ago.
      ff0ac57d
    • Tom Lane's avatar
      While making the seq_page_cost changes, I was struck by the fact that · 7868590c
      Tom Lane authored
      cost_nonsequential_access() is really totally inappropriate for its only
      remaining use, namely estimating I/O costs in cost_sort().  The routine
      was designed on the assumption that disk caching might eliminate the need
      for some re-reads on a random basis, but there's nothing very random in
      that sense about sort's access pattern --- it'll always be picking up the
      oldest outputs.  If we had a good fix on the effective cache size we
      might consider charging zero for I/O unless the sort temp file size
      exceeds it, but that's probably putting much too much faith in the
      parameter.  Instead just drop the logic in favor of a fixed compromise
      between seq_page_cost and random_page_cost per page of sort I/O.
      7868590c
Loading