upstream/postgresql
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2026-02-20 16:30:40 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions
postgresql/src/include/optimizer
History
Tom Lane 282d2a03dd HOT updates. When we update a tuple without changing any of its indexed 
columns, and the new version can be stored on the same heap page, we no longer
generate extra index entries for the new version.  Instead, index searches
follow the HOT-chain links to ensure they find the correct tuple version.

In addition, this patch introduces the ability to "prune" dead tuples on a
per-page basis, without having to do a complete VACUUM pass to recover space.
VACUUM is still needed to clean up dead index entries, however.

Pavan Deolasee, with help from a bunch of other people.
2007-09-20 17:56:33 +00:00
..
clauses.h Get rid of some old and crufty global variables in the planner. When 2007-02-19 07:03:34 +00:00
cost.h Rename DLLIMPORT macro to PGDLLIMPORT to avoid conflict with 2007-07-25 12:22:54 +00:00
geqo.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_copy.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_gene.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_misc.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_mutation.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_pool.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_random.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_recombination.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
geqo_selection.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
joininfo.h Refactor planner's pathkeys data structure to create a separate, explicit 2007-01-20 20:45:41 +00:00
pathnode.h Refactor planner's pathkeys data structure to create a separate, explicit 2007-01-20 20:45:41 +00:00
paths.h Fix best_inner_indexscan to return both the cheapest-total-cost and 2007-05-22 01:40:33 +00:00
plancat.h Rename DLLIMPORT macro to PGDLLIMPORT to avoid conflict with 2007-07-25 12:22:54 +00:00
planmain.h Teach tuplesort.c about "top N" sorting, in which only the first N tuples 2007-05-04 01:13:45 +00:00
planner.h Rename DLLIMPORT macro to PGDLLIMPORT to avoid conflict with 2007-07-25 12:22:54 +00:00
predtest.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
prep.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
restrictinfo.h Refactor planner's pathkeys data structure to create a separate, explicit 2007-01-20 20:45:41 +00:00
subselect.h Get rid of some old and crufty global variables in the planner. When 2007-02-19 07:03:34 +00:00
tlist.h Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
var.h HOT updates. When we update a tuple without changing any of its indexed 2007-09-20 17:56:33 +00:00