Log Message:
---
Fix my typo
Modified Files:
--
pgsql/src/bin/psql:
help.c (r1.141 -> r1.142)
(http://anoncvs.postgresql.org/cvsweb.cgi/pgsql/src/bin/psql/help.c?r1=1.141&r2=1.142)
--
Sent via pgsql-committers mailing list (pgsql-committers@postgresql.org
Update of /cvsroot/hstore-new/hstore-new
In directory pgfoundry.org:/tmp/cvs-serv45548
Log Message:
Initial import
Status:
Vendor Tag: VENDOR
Release Tags: VENDOR1
N hstore-new/Makefile
N hstore-new/hstore_op.c
N hstore-new/hstore-new.sql.in
N hstore-new/hstore_io.c
N hsto
Log Message:
---
Implement "fastupdate" support for GIN indexes, in which we try to accumulate
multiple index entries in a holding area before adding them to the main index
structure. This helps because bulk insert is (usually) significantly faster
than retail insert for GIN.
This patch a
Log Message:
---
Fix stupid parenthesization mistake. Per bug #4728 from Bruce Toll.
Modified Files:
--
pgsql/src/backend/optimizer/plan:
planner.c (r1.251 -> r1.252)
(http://anoncvs.postgresql.org/cvsweb.cgi/pgsql/src/backend/optimizer/plan/planner.c?r1=1
Log Message:
---
Add a textbox to setup dialog to change the directory for logging.
Modified Files:
--
psqlodbc:
dlg_specific.c (r1.84 -> r1.85)
(http://cvs.pgfoundry.org/cgi-bin/cvsweb.cgi/psqlodbc/psqlodbc/dlg_specific.c.diff?r1=1.84&r2=1.85)
dlg_
Log Message:
---
Install a search tree depth limit in GIN bulk-insert operations, to prevent
them from degrading badly when the input is sorted or nearly so. In this
scenario the tree is unbalanced to the point of becoming a mere linked list,
so insertions become O(N^2). The easiest and m
Log Message:
---
Install a search tree depth limit in GIN bulk-insert operations, to prevent
them from degrading badly when the input is sorted or nearly so. In this
scenario the tree is unbalanced to the point of becoming a mere linked list,
so insertions become O(N^2). The easiest and m
Log Message:
---
Install a search tree depth limit in GIN bulk-insert operations, to prevent
them from degrading badly when the input is sorted or nearly so. In this
scenario the tree is unbalanced to the point of becoming a mere linked list,
so insertions become O(N^2). The easiest and m
