- 19 3月, 2008 2 次提交
-
-
由 Magnus Hagander 提交于
-
由 Magnus Hagander 提交于
on developer.postgresql.org is going away.
-
- 18 3月, 2008 24 次提交
-
-
由 Bruce Momjian 提交于
o Allow UPDATE tab SET ROW (col, ...) = (SELECT...) > http://archives.postgresql.org/pgsql-patches/2007-04/msg00315.php > http://archives.postgresql.org/pgsql-patches/2008-03/msg00237.php
-
由 Alvaro Herrera 提交于
-
由 Bruce Momjian 提交于
* Speed WAL recovery by allowing more than one page to be prefetched This involves having a separate process that can be told which pages the recovery process will need in the near future. > http://archives.postgresql.org/pgsql-general/2007-12/msg00683.php > http://archives.postgresql.org/pgsql-hackers/2007-12/msg00497.php <
-
由 Tom Lane 提交于
during a bitmap index scan. This cannot affect the query results (since we're just dumping the TIDs into a bitmap) but it might offer some advantage in locality of access to the index. Per Greg Stark.
-
由 Bruce Momjian 提交于
> o Recreate pg_xlog/archive_status/ if it doesn't exist after > restoring from a PITR backup > > http://archives.postgresql.org/pgsql-hackers/2007-12/msg00487.php
-
由 Tom Lane 提交于
value for a precision is negative, act as though precision weren't specified at all, that is the whole .* part of the format spec should be ignored. Our previous coding took it as .0 which is certainly wrong. Per report from Kris Jurka and local testing. Possibly this should be back-patched, but it would be good to get some more testing first; in any case there are no known cases where there's really a problem on the backend side.
-
由 Bruce Momjian 提交于
> > * Consider Cartesian joins when both relations are needed to form an > indexscan qualification for a third relation > > http://archives.postgresql.org/pgsql-performance/2007-12/msg00090.php
-
由 Bruce Momjian 提交于
o Allow COPY to report error lines and continue This requires the use of a savepoint before each COPY line is processed, with ROLLBACK on COPY failure. > http://archives.postgresql.org/pgsql-hackers/2007-12/msg00572.php
-
由 Bruce Momjian 提交于
> > * Allow SSL key file permission checks to be optionally disabled when > sharing SSL keys with other applications > > http://archives.postgresql.org/pgsql-bugs/2007-12/msg00069.php
-
由 Bruce Momjian 提交于
> > * Reduce BIT data type overhead using short varlena headers > > http://archives.postgresql.org/pgsql-general/2007-12/msg00273.php
-
由 Bruce Momjian 提交于
> * Reduce file system activity overhead of statistics file pgstat.stat > > http://archives.postgresql.org/pgsql-general/2007-12/msg00106.php >
-
由 Bruce Momjian 提交于
> * Consider if CommandCounterIncrement() can avoid its > AcceptInvalidationMessages() call > > http://archives.postgresql.org/pgsql-committers/2007-11/msg00585.php
-
由 Bruce Momjian 提交于
* Add SQL:2003 WITH RECURSIVE (hierarchical) queries to SELECT > http://archives.postgresql.org/pgsql-hackers/2007-11/msg01334.php
-
由 Bruce Momjian 提交于
> > o Remove pre-7.3 pg_dump code that assumes pg_depend does not exit
-
由 Bruce Momjian 提交于
* Improve text search error messages > http://archives.postgresql.org/pgsql-hackers/2007-11/msg01146.php
-
由 Bruce Momjian 提交于
> * Improve text search error messages > > http://archives.postgresql.org/pgsql-hackers/2007-10/msg00966.php > > > * Fix /contrib/ltree operator > > http://archives.postgresql.org/pgsql-bugs/2007-11/msg00044.php
-
由 Bruce Momjian 提交于
> > o Fix server restart problem when the server was shutdown during > a PITR backup > > http://archives.postgresql.org/pgsql-hackers/2007-11/msg00800.php >
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
* Consider increasing the number of default statistics target, and reduce statistics target overhead > http://archives.postgresql.org/pgsql-hackers/2008-01/msg01066.php
-
由 Peter Eisentraut 提交于
support DTrace in the future. Switch from using DTRACE_PROBEn macros to the dynamically generated macros. Use "dtrace -h" to create a header file that contains the dynamically generated macros to be used in the source code instead of the DTRACE_PROBEn macros. A dummy header file is generated for builds without DTrace support. Author: Robert Lor <Robert.Lor@sun.com>
-
由 Peter Eisentraut 提交于
changed in case a new file got added.
-
由 Bruce Momjian 提交于
> > o Allow Kerberos to disable stripping of realms so we can > check the username@realm against multiple realms > > http://archives.postgresql.org/pgsql-hackers/2007-11/msg00009.php
-
由 Magnus Hagander 提交于
While at it, rename option lookup functions to make names clearer, per discussion with Tom.
-
由 Tom Lane 提交于
make_greater_string needs the < procedure not the >= one. Spotted by Peter.
-
- 17 3月, 2008 8 次提交
-
-
由 Alvaro Herrera 提交于
needed anywhere after my previous patch. Noticed by Tom Lane. Also, remove #include <signal.h> from sinval.c.
-
由 Tom Lane 提交于
oprofile shows that a nontrivial amount of time is being spent in repeated calls to index_getprocinfo, which really only needs to be called once. So do that, and inline _hash_datum2hashkey to make it work.
-
由 Tom Lane 提交于
linear search when checking child-transaction XIDs. This makes for an important speedup in transactions that have large numbers of children, as in a recent example from Craig Ringer. We can also get rid of an ugly kluge that represented lists of TransactionIds as lists of OIDs. Heikki Linnakangas
-
由 Bruce Momjian 提交于
> o -During index creation, pre-sort the tuples to improve build speed
-
由 Tom Lane 提交于
maintenance_work_mem and effective_cache_size on index creation speed.
-
由 Tom Lane 提交于
bucket number, so as to ensure locality of access to the index during the insertion step. Without this, building an index significantly larger than available RAM takes a very long time because of thrashing. On the other hand, sorting is just useless overhead when the index does fit in RAM. We choose to sort when the initial index size exceeds effective_cache_size. This is a revised version of work by Tom Raney and Shreya Bhargava.
-
由 Alvaro Herrera 提交于
deals with the queue, including locking etc, is all in sinvaladt.c. This means that the struct definition of the queue, and the queue pointer, are now internal "implementation details" inside sinvaladt.c. Per my proposal dated 25-Jun-2007 and followup discussion.
-
由 Magnus Hagander 提交于
-
- 16 3月, 2008 1 次提交
-
-
由 Tom Lane 提交于
two buckets at the start, we create a number of buckets appropriate for the estimated size of the table. This avoids a lot of expensive bucket-split actions during initial index build on an already-populated table. This is one of the two core ideas of Tom Raney and Shreya Bhargava's patch to reduce hash index build time. I'm committing it separately to make it easier for people to test the effects of this separately from the effects of their other core idea (pre-sorting the index entries by bucket number).
-
- 15 3月, 2008 3 次提交
-
-
由 Tom Lane 提交于
This accidentally failed to fail before 8.3, because the context we were switching back to was long-lived anyway; but it sure looks risky as can be now. Well spotted by Pavan Deolasee.
-
由 Alvaro Herrera 提交于
-
由 Alvaro Herrera 提交于
job (i.e. to prevent Xid wraparound problems.) Bug reported by ITAGAKI Takahiro in 20080314103837.63D3.52131E4D@oss.ntt.co.jp, though I didn't use his patch.
-
- 14 3月, 2008 2 次提交