Skip to content
Snippets Groups Projects
  1. Dec 08, 2001
  2. Sep 03, 2001
  3. Mar 05, 2001
  4. Oct 05, 2000
  5. Sep 12, 2000
  6. Aug 29, 2000
  7. Aug 07, 2000
  8. Jul 14, 2000
  9. Jun 18, 2000
  10. Jun 09, 2000
  11. May 18, 2000
  12. Apr 18, 2000
  13. Apr 15, 2000
  14. Apr 14, 2000
  15. Apr 11, 2000
  16. Apr 09, 2000
  17. Apr 07, 2000
  18. Mar 31, 2000
  19. Mar 26, 2000
  20. Mar 17, 2000
  21. Feb 27, 2000
  22. Feb 19, 2000
  23. Feb 15, 2000
    • Tom Lane's avatar
      New cost model for planning, incorporating a penalty for random page · b1577a7c
      Tom Lane authored
      accesses versus sequential accesses, a (very crude) estimate of the
      effects of caching on random page accesses, and cost to evaluate WHERE-
      clause expressions.  Export critical parameters for this model as SET
      variables.  Also, create SET variables for the planner's enable flags
      (enable_seqscan, enable_indexscan, etc) so that these can be controlled
      more conveniently than via PGOPTIONS.
      
      Planner now estimates both startup cost (cost before retrieving
      first tuple) and total cost of each path, so it can optimize queries
      with LIMIT on a reasonable basis by interpolating between these costs.
      Same facility is a win for EXISTS(...) subqueries and some other cases.
      
      Redesign pathkey representation to achieve a major speedup in planning
      (I saw as much as 5X on a 10-way join); also minor changes in planner
      to reduce memory consumption by recycling discarded Path nodes and
      not constructing unnecessary lists.
      
      Minor cleanups to display more-plausible costs in some cases in
      EXPLAIN output.
      
      Initdb forced by change in interface to index cost estimation
      functions.
      b1577a7c
  24. Jul 22, 1999
  25. Jul 15, 1999
  26. Jul 14, 1999
  27. Jul 06, 1999
  28. Jun 17, 1999
  29. Jun 14, 1999
  30. Jun 09, 1999
  31. Jun 08, 1999
  32. Jun 04, 1999
  33. Jun 03, 1999
Loading