* Allow CLUSTER on all tables at once, and improve CLUSTER

* Generate error on CREATE OPERATOR of ~~, ~ and and ~*

* Add SIMILAR TO to allow character classes, 'pg_[a-c]%'

* Auto-destroy sequence on DROP of table with SERIAL

* Auto-destroy sequence on DROP of table with SERIAL(Ryan)

* Allow LOCK TABLE tab1, tab2, tab3 so all tables locked in unison

* Allow INSERT/UPDATE of system-generated oid value for a row

* Allow ESCAPE '\' at the end of LIKE for ANSI compliance

MISC

* Increase identifier length(NAMEDATALEN) if small performance hit

* Allow row re-use without vacuum, maybe?(Vadim)

* Allow row re-use without vacuum(Vadim)

* Create a background process for each database that runs while

database is idle, finding superceeded rows, gathering stats and vacuuming

* Add UNIQUE capability to non-btree indexes

* Certain indexes will not shrink, i.e. oid indexes with many inserts

* Restore unused oid's on backend exit if no one else has gotten oids

* Have UPDATE/DELETE clean out indexes

* Allow WHERE restriction on ctid

* Allow cursors to be DECLAREd/OPENed/CLOSEed outside transactions

* Allow PQrequestCancel() to terminate when in waiting-for-lock state

* Transaction log, so re-do log can be on a separate disk

* Transaction log, so re-do log can be on a separate disk by

logging SQL queries, or before/after row images

* Populate backend status area and write program to dump status data

* Make oid use unsigned int more reliably, pg_atoi()

* Allow subqueries in target list

* Allow LIMIT ability on single-table queries that have no ORDER BY to use

a matching index

* Improve LIMIT processing by using index to limit rows processed

* Have optimizer take LIMIT into account when considering index scans

CACHE

* Create more system table indexes for faster cache lookups

* Improve Subplan list handling

* Allow Subplans to use efficient joins(hash, merge) with upper variable

* use fmgr_info()/fmgr_faddr() instead of fmgr() calls in high-traffic

places, like GROUP BY, UNIQUE, index processing, etc.

* improve dynamic memory allocation by introducing tuple-context memory

allocation

* add pooled memory allocation where allocations are freed only as a group

SOURCE CODE

* Michael is Michael Meskes <meskes@postgresql.org>

* Oleg is Oleg Bartunov <oleg@sai.msu.su>

* Peter is Peter T Mount <peter@retep.org.uk>

* Ryan is Ryan Bradetich <rbrad@hpb50023.boi.hp.com>

* Stefan Simkovics <ssimkovi@rainbow.studorg.tuwien.ac.at>

* Tatsuo is Tatsuo Ishii <t-ishii@sra.co.jp>

* Tom is Tom Lane <tgl@sss.pgh.pa.us>

staticboolreset_XactIsoLevel(void);

staticboolparse_XactIsoLevel(constchar*);

externCost_cpu_page_wight_;

externCost_cpu_page_weight_;

externCost_cpu_index_page_wight_;

externbool_use_geqo_;

externint32_use_geqo_rels_;

}

res=float4in((char*)value);

_cpu_page_wight_=*res;

_cpu_page_weight_=*res;

return TRUE;

}

show_cost_heap()

{

elog(NOTICE,"COST_HEAP is %f",_cpu_page_wight_);

elog(NOTICE,"COST_HEAP is %f",_cpu_page_weight_);

return TRUE;

}

reset_cost_heap()

{

_cpu_page_wight_=_CPU_PAGE_WEIGHT_;

_cpu_page_weight_=_CPU_PAGE_WEIGHT_;

return TRUE;

}

bool_enable_mergejoin_= true;

bool_enable_hashjoin_= true;

Cost_cpu_page_wight_=_CPU_PAGE_WEIGHT_;

Cost_cpu_page_weight_=_CPU_PAGE_WEIGHT_;

Cost_cpu_index_page_wight_=_CPU_INDEX_PAGE_WEIGHT_;

{

temp+=relpages;

temp+=_cpu_page_wight_*reltuples;

temp+=_cpu_page_weight_*reltuples;

}

Assert(temp >=0);

returntemp;

temp+=_cpu_index_page_wight_*selec*indextuples;

temp+=_cpu_page_wight_*selec*reltuples;

temp+=_cpu_page_weight_*selec*reltuples;

Assert(temp >=0);

returntemp;

temp+=_cpu_page_wight_*tuples*base_log((double)tuples,2.0);

temp+=_cpu_page_weight_*tuples*base_log((double)tuples,2.0);

Assert(temp>0);

Costtemp=0;

temp=temp+page_size(tuples,width);

temp=temp+_cpu_page_wight_*tuples;

temp=temp+_cpu_page_weight_*tuples;

Assert(temp >=0);

returntemp;

}

temp+=cost_sort(outersortkeys,outersize,outerwidth);

if (innersortkeys)/* do we need to sort? */

temp+=cost_sort(innersortkeys,innersize,innerwidth);

temp+=_cpu_page_wight_* (outersize+innersize);

temp+=_cpu_page_weight_* (outersize+innersize);

Assert(temp >=0);

temp+=outercost+innercost;

temp+=_cpu_page_wight_* (outersize+innersize);

temp+=_cpu_page_weight_* (outersize+innersize);

temp+= (innerpages<NBuffers) ?innerpages :NBuffers;