- 03 Jun, 2010 2 commits
-
-
Bruce Momjian authored
Tim Landscheidt
-
Bruce Momjian authored
overlaps. David Fetter
-
- 02 Jun, 2010 1 commit
-
-
Heikki Linnakangas authored
Fujii Masao
-
- 01 Jun, 2010 6 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
release notes.
-
Bruce Momjian authored
-
Bruce Momjian authored
-
Bruce Momjian authored
Craig Ringer
-
Bruce Momjian authored
Greg Sabino Mullane
-
- 31 May, 2010 7 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
-
Bruce Momjian authored
details from Alvaro Herrera.
-
Bruce Momjian authored
performed by "EXECUTE ... INTO". Jaime Casanova
-
Alvaro Herrera authored
per Josh Berkus. Add ALTER DATABASE to the "see also" section, too.
-
Bruce Momjian authored
them off. Josh Berkus, with slight wording changes by me.
-
Heikki Linnakangas authored
This was broken by my previous patch to send WAL in smaller batches. Patch by Fujii Masao.
-
- 30 May, 2010 3 commits
-
-
Tom Lane authored
We must filter out hashtable entries with frequencies less than those specified by the algorithm, else we risk emitting junk entries whose actual frequency is much less than other lexemes that did not get tabulated. This is bad enough by itself, but even worse is that tsquerysel() believes that the minimum frequency seen in pg_statistic is a hard upper bound for lexemes not included, and was thus underestimating the frequency of non-MCEs. Also, set the threshold frequency to something with a little bit of theory behind it, to wit assume that the input distribution is approximately Zipfian. This might need adjustment in future, but some preliminary experiments suggest that it's not too unreasonable. Back-patch to 8.4, where this code was introduced. Jan Urbanski, with some editorialization by Tom
-
Tom Lane authored
"val AS name" to "name := val", as per recent discussion. This patch catches everything in the original named-parameters patch, but I'm not certain that no other dependencies snuck in later (grepping the source tree for all uses of AS soon proved unworkable). In passing I note that we've dropped the ball at least once on keeping ecpg's lexer (as opposed to parser) in sync with the backend. It would be a good idea to go through all of pgc.l and see if it's in sync now. I didn't attempt that at the moment.
-
Bruce Momjian authored
-
- 29 May, 2010 4 commits
-
-
Tom Lane authored
table with foreign key constraints eats memory. Per off-line discussion of bug #5480 with its reporter. Also do some minor wordsmithing elsewhere in the same section.
-
Bruce Momjian authored
-
Heikki Linnakangas authored
-
Bruce Momjian authored
if we ever implement '<>' index opclasses. Jeff Davis
-
- 28 May, 2010 7 commits
-
-
Tom Lane authored
output stream. This typically indicates that the user quit out of $PAGER, or that we are writing to a file and ran out of disk space. In either case we shouldn't bother to continue fetching data. Stephen Frost
-
Tom Lane authored
end of the pattern: the code path that handles \ just after % should throw error too. As in the previous patch, not back-patching for fear of breaking apps that worked before.
-
Bruce Momjian authored
David Fetter
-
Tom Lane authored
for sure ;-)). It now also optimizes more cases, such as %_%_. Improve comments too. Per bug #5478. In passing, also rename the TCHAR macro to GETCHAR, because pgindent is messing with the formatting of the former (apparently it now thinks TCHAR is a typedef name). Back-patch to 8.3, where the bug was introduced.
-
Itagaki Takahiro authored
but is __declspec (dllimport) on other compilers because cygwin and mingw don't like dllexport.
-
Heikki Linnakangas authored
move two paragraphs that apply to log shipping in general from the "Alternative method for log shipping" section to the earlier sections. Add varname tags where missing. Some small wording changes.
-
Tom Lane authored
is treated like end-of-input, if nulls sort last in that column and we are not doing outer-join filling for that input. In such a case, the tuple cannot join to anything from the other input (because we assume mergejoinable operators are strict), and neither can any tuple following it in the sort order. If we're not interested in doing outer-join filling we can just pretend the tuple and its successors aren't there at all. This can save a great deal of time in situations where there are many nulls in the join column, as in a recent example from Scott Marlowe. Also, since the planner tends to not count nulls in its mergejoin scan selectivity estimates, this is an important fix to make the runtime behavior more like the estimate. I regard this as an omission in the patch I wrote years ago to teach mergejoin that tuples containing nulls aren't joinable, so I'm back-patching it. But only to 8.3 --- in older versions, we didn't have a solid notion of whether nulls sort high or low, so attempting to apply this optimization could break things.
-
- 27 May, 2010 8 commits
-
-
Tom Lane authored
This saves cycles in get_ps_display() on many popular platforms, and more importantly ensures that get_ps_display() will correctly return an empty string if init_ps_display() hasn't been called yet. Per trouble report from Ray Stell, in which log_line_prefix %i produced junk early in backend startup. Back-patch to 8.0. 7.4 doesn't have %i and its version of get_ps_display() makes no pretense of avoiding pad junk anyhow.
-
Peter Eisentraut authored
-
Tom Lane authored
immutable, but that is wrong in general because the cast from the polymorphic argument to text could be stable or even volatile. Mark them volatile for safety. In the typical case where the cast isn't volatile, the planner will deduce the correct expression volatility after inlining the function, so performance is not lost. The just-committed fix in CREATE INDEX also ensures this won't break any indexing cases that ought to be allowed. Per discussion, I'm not bumping catversion for this change, as it doesn't seem critical enough to force an initdb on beta testers.
-
Tom Lane authored
before it checks whether the expression is immutable. This covers two cases that were previously handled poorly: 1. SQL function inlining could reduce the apparent volatility of the expression, allowing an expression to be accepted where it previously would not have been. As an example, polymorphic functions must be marked with the worst-case volatility they have for any argument type, but for specific argument types they might not be so volatile, so indexing could be allowed. (Since the planner will refuse to inline functions in cases where the apparent volatility of the expression would increase, this won't break any cases that were accepted before.) 2. A nominally immutable function could have default arguments that are volatile expressions. In such a case insertion of the defaults will increase both the apparent and actual volatility of the expression, so it is *necessary* to check this before allowing the expression to be indexed. Back-patch to 8.4, where default arguments were introduced.
-
Itagaki Takahiro authored
independently from BUILDING_DLL. It is always __declspec(dllexport).
-
Heikki Linnakangas authored
RELEASE SAVEPOINT to make an older savepoint with the same name accessible. It's also possible to implicitly release the savepoint by rolling back to an earlier savepoint, but mentioning that too would make the note just more verbose and confusing.
-
Robert Haas authored
In particular, it's bad to start walreceiver when in state PM_WAIT_BACKENDS, because we have no provision to kill walreceiver when in that state. Fujii Masao
-
Heikki Linnakangas authored
Robert Haas.
-
- 26 May, 2010 2 commits
-
-
Bruce Momjian authored
-
Tom Lane authored
chains, do assorted wordsmithing.
-