- 18 3月, 2008 5 次提交
-
-
由 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 4 次提交
-
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
that are reported as "equal" by wcscoll() are checked to see if they really are bitwise equal, and are sorted per strcmp() if not. We made this happen a couple of years ago in the regular code path, but it unaccountably got left out of the Windows/UTF8 case (probably brain fade on my part at the time). As in the prior set of changes, affected users may need to reindex indexes on textual columns. Backpatch as far as 8.2, which is the oldest release we are still supporting on Windows.
-
由 Tom Lane 提交于
messages if the calling transaction aborts later on. Collapsing out line pointer redirects is a done deal as soon as we complete the page update, so syscache *must* be notified even if the VACUUM FULL as a whole doesn't complete. To fix, add some functionality to inval.c to allow the pending inval messages to be sent immediately while heap_page_prune is still running. The implementation is a bit chintzy: it will only work in the context of VACUUM FULL. But that's all we need now, and it can always be extended later if needed. Per my trouble report of a week ago.
-
- 13 3月, 2008 13 次提交
-
-
由 Bruce Momjian 提交于
* Do async I/O for faster random read-ahead of data Async I/O allows multiple I/O requests to be sent to the disk with results coming back asynchronously. > http://archives.postgresql.org/pgsql-performance/2007-09/msg00255.php
-
由 Tom Lane 提交于
(probably NULL) before exiting. Up to now it's just left the variable as it set it, which means that after we're done processing the current client message, ActiveSnapshot is probably pointing at garbage (because this function is typically run in MessageContext which will get reset). There doesn't seem to have been any code path in which that mattered before 8.3, but now the plancache module might try to use the stale value if the next client message is a Bind for a prepared statement that is in need of replanning. Per report from Alex Hunsaker.
-
由 Bruce Momjian 提交于
< * Include the symbolic SQLSTATE name in verbose error reports < < http://archives.postgresql.org/pgsql-general/2007-09/msg00438.php
-
由 Bruce Momjian 提交于
> * Expire published xmin for read-only and idle transactions > > http://archives.postgresql.org/pgsql-hackers/2007-09/msg00343.php
-
由 Tom Lane 提交于
pg_listener modifications commanded by LISTEN and UNLISTEN until the end of the current transaction. This allows us to hold the ExclusiveLock on pg_listener until after commit, with no greater risk of deadlock than there was before. Aside from fixing the race condition, this gets rid of a truly ugly kludge that was there before, namely having to ignore HeapTupleBeingUpdated failures during NOTIFY. There is a small potential incompatibility, which is that if a transaction issues LISTEN or UNLISTEN and then looks into pg_listener before committing, it won't see any resulting row insertion or deletion, where before it would have. It seems unlikely that anyone would be depending on that, though. This patch also disallows LISTEN and UNLISTEN inside a prepared transaction. That case had some pretty undesirable properties already, such as possibly allowing pg_listener entries to be made for PIDs no longer present, so disallowing it seems like a better idea than trying to maintain the behavior.
-
由 Bruce Momjian 提交于
> > * Consider a special data type for regular expressions > > http://archives.postgresql.org/pgsql-hackers/2007-08/msg01067.php
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
* Add array_accum() and array_to_set() functions for arrays The standards specify array_agg() and UNNEST. http://archives.postgresql.org/pgsql-hackers/2007-08/msg00464.php
-
由 Bruce Momjian 提交于
* Consider a simplified API for full text searches > http://archives.postgresql.org/pgsql-hackers/2007-08/msg01067.php
-
由 Bruce Momjian 提交于
> > o Convert MSVC build system to remove most batch files > > http://archives.postgresql.org/pgsql-hackers/2007-08/msg00961.php
-
由 Bruce Momjian 提交于
* Add REINDEX CONCURRENTLY, like CREATE INDEX CONCURRENTLY > http://archives.postgresql.org/pgsql-performance/2007-08/msg00289.php
-
由 Bruce Momjian 提交于
> o Diagnose problem where shared memory can sometimes not be > attached by postmaster children > > http://archives.postgresql.org/pgsql-general/2007-08/msg01377.php >
-
由 Bruce Momjian 提交于
> > * Remove use of MAKE_PTR and MAKE_OFFSET macros > > http://archives.postgresql.org/pgsql-general/2007-08/msg01510.php
-
- 12 3月, 2008 6 次提交
-
-
由 Bruce Momjian 提交于
> > * Add array_accum() and array_to_set() functions for arrays > > http://archives.postgresql.org/pgsql-hackers/2007-08/msg00464.php
-
由 Tom Lane 提交于
comply with TPC-B. Per Itagaki Takahiro and discussion of bug#3681.
-
由 Bruce Momjian 提交于
* Improve speed with indexes For large table adjustments during VACUUM FULL, it is faster to cluster or reindex rather than update the index. Also, index updates can bloat the index. > http://archives.postgresql.org/pgsql-hackers/2007-08/msg00307.php
-
由 Bruce Momjian 提交于
> > * Allow domains to be cast > > http://archives.postgresql.org/pgsql-hackers/2003-06/msg01206.php > http://archives.postgresql.org/pgsql-hackers/2007-08/msg00289.php
-
由 Bruce Momjian 提交于
> > * Consider simplifying how memory context resets handle child contexts > > http://archives.postgresql.org/pgsql-patches/2007-08/msg00067.php
-