aboutsummaryrefslogtreecommitdiff
path: root/src/include/optimizer/cost.h
Commit message (Expand)AuthorAge
* Update copyrights for 2013Bruce Momjian2013-01-01
* Fix up planner infrastructure to support LATERAL properly.Tom Lane2012-08-26
* More fixes for planner's handling of LATERAL.Tom Lane2012-08-12
* Implement SQL-standard LATERAL subqueries.Tom Lane2012-08-07
* Run pgindent on 9.2 source tree in preparation for first 9.3Bruce Momjian2012-06-10
* Revise parameterized-path mechanism to fix assorted issues.Tom Lane2012-04-19
* Use parameterized paths to generate inner indexscans more flexibly.Tom Lane2012-01-27
* Update copyright notices for year 2012.Bruce Momjian2012-01-01
* Rethink representation of index clauses' mapping to index columns.Tom Lane2011-12-24
* Support index-only scans using the visibility map to avoid heap fetches.Tom Lane2011-10-07
* Rearrange planner to save the whole PlannerInfo (subroot) for a subquery.Tom Lane2011-09-03
* Improve cost estimation for aggregates and window functions.Tom Lane2011-04-24
* pgindent run before PG 9.1 beta 1.Bruce Momjian2011-04-10
* Implement an API to let foreign-data wrappers actually be functional.Tom Lane2011-02-20
* Stamp copyrights for year 2011.Bruce Momjian2011-01-01
* Create core infrastructure for KNNGIST.Tom Lane2010-12-02
* Improve relation width estimation for subqueries.Tom Lane2010-11-19
* Support MergeAppend plans, to allow sorted output from append relations.Tom Lane2010-10-14
* Teach CLUSTER to use seqscan-and-sort when it's faster than indexscan.Tom Lane2010-10-07
* Remove cvs keywords from all files.Magnus Hagander2010-09-20
* Add an 'enable_material' GUC.Robert Haas2010-04-19
* Update copyright for the year 2010.Bruce Momjian2010-01-02
* Improve planning of Materialize nodes inserted atop the inner input of aTom Lane2009-11-15
* Rewrite the planner's handling of materialized plan types so that there isTom Lane2009-09-12
* 8.4 pgindent run, with new combined Linux/FreeBSD/MinGW typedef listBruce Momjian2009-06-11
* Create a third option named "partition" for constraint_exclusion, and make itTom Lane2009-01-07
* Update copyright for 2009.Bruce Momjian2009-01-01
* Support window functions a la SQL:2008.Tom Lane2008-12-28
* Implement SQL-standard WITH clauses, including WITH RECURSIVE.Tom Lane2008-10-04
* Arrange to convert EXISTS subqueries that are equivalent to hashable INTom Lane2008-08-22
* Implement SEMI and ANTI joins in the planner and executor. (Semijoins replaceTom Lane2008-08-14
* Update copyrights in source tree to 2008.Bruce Momjian2008-01-01
* Fix cost estimates for EXISTS subqueries that are evaluated as initPlansTom Lane2007-09-22
* Rename DLLIMPORT macro to PGDLLIMPORT to avoid conflict withMagnus Hagander2007-07-25
* Teach tuplestore.c to throw away data before the "mark" point when the callerTom Lane2007-05-21
* Teach tuplesort.c about "top N" sorting, in which only the first N tuplesTom Lane2007-05-04
* Turn the rangetable used by the executor into a flat list, and avoid storingTom Lane2007-02-22
* Add COST and ROWS options to CREATE/ALTER FUNCTION, plus underlying pg_procTom Lane2007-01-22
* Update CVS HEAD for 2007 copyright. Back branches are typically notBruce Momjian2007-01-05
* pgindent run for 8.2.Bruce Momjian2006-10-04
* Increase default value of effective_cache_size to 128MB, per discussion.Tom Lane2006-09-25
* Improve usage of effective_cache_size parameter by assuming that all theTom Lane2006-09-19
* Add support for multi-row VALUES clauses as part of INSERT statementsJoe Conway2006-08-02
* Convert effective_cache_size to an integer, for better integration withPeter Eisentraut2006-07-26
* In the recent changes to make the planner account better for cacheTom Lane2006-07-22
* Make the planner estimate costs for nestloop inner indexscans on the basisTom Lane2006-06-06
* Increase the default value of cpu_index_tuple_cost from 0.001 to 0.005.Tom Lane2006-06-05
* Add a GUC parameter seq_page_cost, and use that everywhere we formerlyTom Lane2006-06-05
* Update copyright for 2006. Update scripts.Bruce Momjian2006-03-05
* Teach tid-scan code to make use of "ctid = ANY (array)" clauses, so thatTom Lane2005-11-26