summaryrefslogtreecommitdiff
path: root/src/backend/nodes
Commit message (Expand)AuthorAgeFilesLines
* Simplify ParamListInfo data structure to support only numbered parameters,Tom Lane2006-04-225-111/+32
* Support the syntaxTom Lane2006-04-152-60/+10
* Modify all callers of datatype input and receive functions so that if theseTom Lane2006-04-041-3/+2
* Add error location info to ResTarget parse nodes. Allows error cursor to be ...Tom Lane2006-03-233-3/+6
* Clean up representation of function RTEs for functions returning RECORD.Tom Lane2006-03-164-49/+13
* Improve parser so that we can show an error cursor position for errorsTom Lane2006-03-145-7/+59
* Update copyright for 2006. Update scripts.Bruce Momjian2006-03-0514-28/+28
* Add CASCADE option to TRUNCATE. Joachim WielandTom Lane2006-03-032-2/+4
* Add TABLESPACE and ON COMMIT clauses to CREATE TABLE AS. ON COMMIT isNeil Conway2006-02-194-4/+28
* DROP IF EXISTS for ROLE/USER/GROUPAndrew Dunstan2006-02-042-2/+4
* Restructure planner's handling of inheritance. Rather than processingTom Lane2006-01-313-5/+62
* Implement SQL-compliant treatment of row comparisons for < <= > >= casesTom Lane2005-12-284-22/+81
* Teach planner how to rearrange join order for some classes of OUTER JOIN.Tom Lane2005-12-203-4/+51
* Change the parser to translate "foo [NOT] IN (expression-list)" toTom Lane2005-11-281-1/+6
* Teach tid-scan code to make use of "ctid = ANY (array)" clauses, so thatTom Lane2005-11-262-5/+5
* Re-run pgindent, fixing a problem where comment lines after a blankBruce Momjian2005-11-222-7/+7
* DROP DATABASE IF EXISTS variantAndrew Dunstan2005-11-222-2/+4
* Implement DROP OWNED and REASSIGN OWNED. These new commands facilitate theAlvaro Herrera2005-11-212-5/+52
* Clean up after DROP IF EXISTS patch.Tom Lane2005-11-202-2/+4
* Restore the former RestrictInfo field valid_everywhere (but invert the flagTom Lane2005-11-143-3/+6
* Standard pgindent run for 8.1.Bruce Momjian2005-10-1510-171/+168
* Clean up a couple of ad-hoc computations of the maximum number of tuplesTom Lane2005-09-021-2/+2
* Tweak nodeBitmapAnd to stop evaluating sub-plan scans if it finds it'sTom Lane2005-08-281-1/+10
* Change the division of labor between grouping_planner and query_plannerTom Lane2005-08-271-1/+4
* Add NOWAIT option to SELECT FOR UPDATE/SHARE.Tom Lane2005-08-014-10/+52
* Add ALTER object SET SCHEMA capability for a limited but useful set ofTom Lane2005-08-012-6/+40
* Add per-user and per-database connection limit options.Tom Lane2005-07-312-2/+28
* Fix a bunch of bad interactions between partial indexes and the newTom Lane2005-07-281-5/+155
* Add a role property 'rolinherit' which, when false, denotes that the roleTom Lane2005-07-262-2/+4
* Fix logic error in tbm_intersect: the intersection of a normal page andTom Lane2005-07-241-6/+23
* Teach planner about some cases where a restriction clause can beTom Lane2005-07-023-6/+7
* Replace pg_shadow and pg_group by new role-capable catalogs pg_authidTom Lane2005-06-284-128/+84
* Add Oracle-compatible GREATEST and LEAST functions. Pavel StehuleTom Lane2005-06-264-4/+65
* Make REINDEX DATABASE do what one would expect, namely reindex all indexesTom Lane2005-06-222-6/+6
* Two-phase commit. Original patch by Heikki Linnakangas, with additionalTom Lane2005-06-172-2/+4
* Improve hash method for bitmapsets: some examination of actual outputsTom Lane2005-06-151-7/+21
* Simplify the planner's join clause management by storing join clausesTom Lane2005-06-093-44/+6
* Marginal hack to avoid spending a lot of time in find_join_rel duringTom Lane2005-06-081-1/+26
* Nab some low-hanging fruit: replace the planner's base_rel_list andTom Lane2005-06-061-3/+2
* Remove planner's private fields from Query struct, and put them intoTom Lane2005-06-054-24/+88
* Modify hash_search() API to prevent future occurrences of the errorTom Lane2005-05-291-13/+1
* Modify tidbitmap.c to avoid creating a hash table until there is moreTom Lane2005-05-171-149/+291
* Fix duplicate call to WRITE_NODE_FIELD(whereClause) in _outSelectStmtTatsuo Ishii2005-05-091-2/+1
* Change CREATE TYPE to require datatype output and send functions to haveTom Lane2005-05-011-7/+4
* Implement sharable row-level locks, and use them for foreign key referencesTom Lane2005-04-284-7/+14
* Remove support for OR'd indexscans internal to a single IndexScan planTom Lane2005-04-252-26/+24
* Rethink original decision to use AND/OR Expr nodes to represent bitmapTom Lane2005-04-211-1/+29
* Install some slightly realistic cost estimation for bitmap index scans.Tom Lane2005-04-211-1/+3
* Create executor and planner-backend support for decoupled heap and indexTom Lane2005-04-194-18/+216
* Initial implementation of lossy-tuple-bitmap data structures.Tom Lane2005-04-172-2/+776