- 28 1月, 2005 1 次提交
-
-
由 Neil Conway 提交于
Relation. Patch from Alvaro Herrera, minor editorializing by Neil Conway.
-
- 01 1月, 2005 1 次提交
-
-
由 PostgreSQL Daemon 提交于
Tag appropriate files for rc3 Also performed an initial run through of upgrading our Copyright date to extend to 2005 ... first run here was very simple ... change everything where: grep 1996-2004 && the word 'Copyright' ... scanned through the generated list with 'less' first, and after, to make sure that I only picked up the right entries ...
-
- 14 11月, 2004 1 次提交
-
-
由 Neil Conway 提交于
buffer is valid, as ReadBuffer() will elog on error. Most of the call sites of ReadBuffer() got this right, but this patch fixes those call sites that did not.
-
- 27 10月, 2004 1 次提交
-
-
由 Tom Lane 提交于
in all cases when keep_buf = true. This allows ANALYZE's inner loop to use heap_release_fetch, which saves multiple buffer lookups for the same page and avoids overestimation of cost by the vacuum cost mechanism.
-
- 01 10月, 2004 1 次提交
-
-
由 Tom Lane 提交于
now are supposed to take some kind of lock on an index whenever you are going to access the index contents, rather than relying only on a lock on the parent table.
-
- 29 8月, 2004 2 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 06 6月, 2004 1 次提交
-
-
由 Tom Lane 提交于
proposal. Eliminate several dozen now-unnecessary hacks to avoid palloc(0). (It's likely there are more that I didn't find.)
-
- 26 5月, 2004 1 次提交
-
-
由 Neil Conway 提交于
In the past, we used a 'Lispy' linked list implementation: a "list" was merely a pointer to the head node of the list. The problem with that design is that it makes lappend() and length() linear time. This patch fixes that problem (and others) by maintaining a count of the list length and a pointer to the tail node along with each head node pointer. A "list" is now a pointer to a structure containing some meta-data about the list; the head and tail pointers in that structure refer to ListCell structures that maintain the actual linked list of nodes. The function names of the list API have also been changed to, I hope, be more logically consistent. By default, the old function names are still available; they will be disabled-by-default once the rest of the tree has been updated to use the new API names.
-
- 24 5月, 2004 1 次提交
-
-
由 Tom Lane 提交于
ago. This should give significantly better results when the density of live tuples is not uniform throughout a table. Manfred Koizar, with minor kibitzing from Tom Lane.
-
- 09 5月, 2004 1 次提交
-
-
由 Tom Lane 提交于
costing us lots more to maintain than it was worth. On shared tables it was of exactly zero benefit because we couldn't trust it to be up to date. On temp tables it sometimes saved an lseek, but not often enough to be worth getting excited about. And the real problem was that we forced an lseek on every relcache flush in order to update the field. So all in all it seems best to lose the complexity.
-
- 16 2月, 2004 1 次提交
-
-
由 Tom Lane 提交于
This commit teaches ANALYZE to store such stats in pg_statistic, but nothing is done yet about teaching the planner to use 'em. Also, repair longstanding oversight in separate ANALYZE command: it updated the pg_class.relpages and reltuples counts for the table proper, but not for indexes.
-
- 13 2月, 2004 2 次提交
-
-
由 Tom Lane 提交于
indexes, it seems like we ought to put another layer of indirection between the compute_stats functions and the actual data storage. This would allow us to compute the values on-the-fly, for example.
-
由 Tom Lane 提交于
coding by Mark Cave-Ayland, some kibitzing by Tom Lane. initdb forced due to new column in pg_type.
-
- 10 2月, 2004 1 次提交
-
-
由 Tom Lane 提交于
subroutine in src/port/pgsleep.c. Remove platform dependencies from miscadmin.h and put them in port.h where they belong. Extend recent vacuum cost-based-delay patch to apply to VACUUM FULL, ANALYZE, and non-btree index vacuuming. By the way, where is the documentation for the cost-based-delay patch?
-
- 07 1月, 2004 1 次提交
-
-
由 Neil Conway 提交于
- Update comment in IsReservedName() to the present day - Improve some variable & function names in commands/vacuum.c. I was planning to rewrite this to avoid lappend(), but since I still intend to do the list rewrite, there's no need for that. - Update some smgr comments which seemed to imply that we still forced all dirty pages to disk at commit-time. - Replace some #ifdef DIAGNOSTIC code with assertions. - Make the distinction between OS-level file descriptors and virtual file descriptors a little clearer in a few comments - Other minor comment improvements in the smgr code
-
- 30 11月, 2003 1 次提交
-
-
由 PostgreSQL Daemon 提交于
$Header: -> $PostgreSQL Changes ...
-
- 18 10月, 2003 1 次提交
-
-
由 Tom Lane 提交于
-
- 25 9月, 2003 1 次提交
-
-
由 Peter Eisentraut 提交于
terms, add some clarifications, fix some untranslatable attempts at dynamic message building.
-
- 12 9月, 2003 2 次提交
- 26 8月, 2003 1 次提交
-
-
由 Bruce Momjian 提交于
interesting info in verbose mode about the analyzed relation (pages, rows per block and rows). Mark Kirkwood
-
- 18 8月, 2003 1 次提交
-
-
由 Tom Lane 提交于
datatype by array_eq and array_cmp; use this to solve problems with memory leaks in array indexing support. The parser's equality_oper and ordering_oper routines also use the cache. Change the operator search algorithms to look for appropriate btree or hash index opclasses, instead of assuming operators named '<' or '=' have the right semantics. (ORDER BY ASC/DESC now also look at opclasses, instead of assuming '<' and '>' are the right things.) Add several more index opclasses so that there is no regression in functionality for base datatypes. initdb forced due to catalog additions.
-
- 04 8月, 2003 2 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 21 7月, 2003 1 次提交
-
-
由 Tom Lane 提交于
-
- 27 6月, 2003 1 次提交
-
-
由 Peter Eisentraut 提交于
-
- 28 5月, 2003 1 次提交
-
-
由 Bruce Momjian 提交于
docs that CLIENT/LOG_MIN_MESSAGES now controls debug_* output location. Doc changes included.
-
- 26 4月, 2003 1 次提交
-
-
由 Tom Lane 提交于
-
- 23 3月, 2003 1 次提交
-
-
由 Tom Lane 提交于
them as arrays of the internal datatype. This requires treating the stavalues columns as 'anyarray' rather than 'text[]', which is not 100% kosher but seems to work fine for the purposes we need for pg_statistic. Perhaps in the future 'anyarray' will be allowed more generally.
-
- 30 11月, 2002 1 次提交
-
-
由 Tom Lane 提交于
operations: make sure we use operators that are compatible, as determined by a mergejoin link in pg_operator. Also, add code to planner to ensure we don't try to use hashed grouping when the grouping operators aren't marked hashable.
-
- 13 11月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 11 11月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
to MemSet is a performance boost.
-
- 10 11月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 24 9月, 2002 1 次提交
-
-
由 Tom Lane 提交于
backends. Given that temp tables now store data locally in the local buffer manager, these things are not going to work safely.
-
- 05 9月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 27 8月, 2002 2 次提交
-
-
由 Tom Lane 提交于
that ANALYZE would not gather any stats for a CHAR(255) column. I still think a width threshold is appropriate for the reasons mentioned in the code, but we can loosen it at least.
-
由 Tom Lane 提交于
array header, and to compute sizing and alignment of array elements the same way normal tuple access operations do --- viz, using the tupmacs.h macros att_addlength and att_align. This makes the world safe for arrays of cstrings or intervals, and should make it much easier to write array-type-polymorphic functions; as examples see the cleanups of array_out and contrib/array_iterator. By Joe Conway and Tom Lane.
-
- 24 8月, 2002 1 次提交
-
-
由 Tom Lane 提交于
value '-2' is used to indicate a variable-width type whose width is computed as strlen(datum)+1. Everything that looks at typlen is updated except for array support, which Joe Conway is working on; at the moment it wouldn't work to try to create an array of cstring.
-
- 11 8月, 2002 1 次提交
-
-
由 Tom Lane 提交于
it takes could be held for quite awhile after the analyze step completes. Rethink locking of pg_statistic in light of this fact. The original scheme took an exclusive lock on pg_statistic, which was okay when the lock could be expected to be released shortly, but that doesn't hold anymore. Back off to a normal writer's lock (RowExclusiveLock). This allows concurrent ANALYZE of nonoverlapping sets of tables, at the price that concurrent ANALYZEs of the same table may fail with 'tuple concurrently updated'.
-