- 07 1月, 2004 5 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
> * -Have psql \dn show only visible temp schemas using current_schemas()
-
由 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
-
由 Neil Conway 提交于
backend.
-
由 Neil Conway 提交于
hide it behind #ifdef WAL_DEBUG blocks.
-
- 06 1月, 2004 9 次提交
-
-
由 Tom Lane 提交于
regular qpqual ('filter condition'), add special-purpose code to nodeIndexscan.c to recheck them. This ends being almost no net addition of code, because the removal of planner code balances out the extra executor code, but it is significantly more efficient when a lossy operator is involved in an OR indexscan. The old implementation had to recheck the entire indexqual in such cases.
-
由 Tom Lane 提交于
with index qual clauses in the Path representation. This saves a little work during createplan and (probably more importantly) allows reuse of cached selectivity estimates during indexscan planning. Also fix latent bug: wrong plan would have been generated for a 'special operator' used in a nestloop-inner-indexscan join qual, because the special operator would not have gotten into the list of quals to recheck. This bug is only latent because at present the special-operator code could never trigger on a join qual, but sooner or later someone will want to do it.
-
由 Neil Conway 提交于
readability and for the sake of consistency with the rest of analyze.c
-
由 Neil Conway 提交于
have WAL, outer joins, and TOAST.
-
由 Neil Conway 提交于
-
由 Neil Conway 提交于
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
known unique (eg, it is a SELECT DISTINCT ... subquery), and not do a redundant unique-ification step.
-
由 Tom Lane 提交于
result for jointypes associated with IN processing.
-
- 05 1月, 2004 3 次提交
-
-
由 Tom Lane 提交于
join conditions in which each OR subclause includes a constraint on the same relation. This implements the other useful side-effect of conversion to CNF format, without its unpleasant side-effects. As per pghackers discussion of a few weeks ago.
-
由 Bruce Momjian 提交于
-
由 Peter Eisentraut 提交于
-
- 04 1月, 2004 10 次提交
-
-
由 Michael Meskes 提交于
-
由 Tom Lane 提交于
run the data through cpp, and we know of at least one platform where unusual cpp behavior breaks the process. So remove the cpp step, and make consequent simplifications.
-
由 Tom Lane 提交于
be cast to unsigned char. We have learned this the hard way before.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
teaching the latter to accept either RestrictInfo nodes or bare clause expressions; and cache the selectivity result in the RestrictInfo node when possible. This extends the caching behavior of approx_selectivity to many more contexts, and should reduce duplicate selectivity calculations.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
Problem report on True64 Unix by Nikola Milutinovic.
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
first time generate an OR indexscan for a two-column index when the WHERE condition is like 'col1 = foo AND (col2 = bar OR col2 = baz)' --- before, the OR had to be on the first column of the index or we'd not notice the possibility of using it. Some progress towards extracting OR indexscans from subclauses of an OR that references multiple relations, too, although this code is #ifdef'd out because it needs more work.
-
- 03 1月, 2004 1 次提交
-
-
由 Tom Lane 提交于
-
- 02 1月, 2004 1 次提交
-
-
由 Tom Lane 提交于
This ensures stdout is kept in sync with messages on stderr. Per report from Olaf Ferger.
-
- 01 1月, 2004 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 31 12月, 2003 5 次提交
-
-
由 Tom Lane 提交于
fields: now they are valid whenever the clause is a binary opclause, not only when it is a potential join clause (there is a new boolean field canjoin to signal the latter condition). This lets us avoid recomputing the relid sets over and over while examining indexes. Still more work to do to make this as useful as it could be, because there are places that could use the info but don't have access to the RestrictInfo node.
-
由 Tom Lane 提交于
LC_CTYPE settings of a database.
-
由 Bruce Momjian 提交于
required.
-
由 Tom Lane 提交于
just look for common clauses that can be pulled out of ORs. Per recent discussion, extracting common clauses seems to be the only really useful effect of normalization, and if we do it explicitly then we can avoid cluttering the qual with partially-redundant duplicated expressions, which was an unpleasant side-effect of the old approach.
-
由 Tom Lane 提交于
number-of-buckets that exceeds the size we actually plan to allow the hash table to grow to. Per trouble report from Sean Shanny.
-
- 30 12月, 2003 5 次提交
-
-
由 Tom Lane 提交于
call. You'd think this would cause some problems, but because of the way hash_create is coded, the only side-effect was creation of a useless memory context for the hashtable.
-
由 Tom Lane 提交于
memory contexts belonging to hash tables. Makes the memory stats printout a little more useful.
-
由 Tom Lane 提交于
conditions is overkill; set_union() does the job about as well, and much more efficiently. Furthermore this avoids assuming that canonicalize_qual() will check for duplicate clauses at all, which it may not always do.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
showed that for common operator names such as '=', the pallocs done by this routine occupied a surprisingly large fraction of the total time for the parser to process an operator.
-