- 05 2月, 2006 6 次提交
-
-
由 Tom Lane 提交于
relations: fix the executor so that we can have an Append plan on the inside of a nestloop and still pass down outer index keys to index scans within the Append, then generate such plans as if they were regular inner indexscans. This avoids the need to evaluate the outer relation multiple times.
-
由 Bruce Momjian 提交于
into a table. Jim C. Nasby
-
由 Tom Lane 提交于
... in fact, it will be applied now in any query whatsoever. I'm still a bit concerned about the cycles that might be expended in failed proof attempts, but given that CE is turned off by default, it's the user's choice whether to expend those cycles or not. (Possibly we should change the simple bool constraint_exclusion parameter to something more fine-grained?)
-
由 Tom Lane 提交于
-
由 Michael Meskes 提交于
Added some default rules to lexer Added log output to prepare statement Added some more stuff to a test case
-
由 Andrew Dunstan 提交于
DROP IF EXISTS for ROLE/USER/GROUP
-
- 04 2月, 2006 8 次提交
-
-
由 Peter Eisentraut 提交于
modified and the server config files are reloaded
-
由 Bruce Momjian 提交于
< * Allow control over which tables are WAL-logged > * Allow control over which tables are WAL-logged [walcontrol] 1038c1038,1039 < stable logging probably can not have indexes. [walcontrol] > stable logging probably can not have indexes. One complexity is > the handling of indexes on TOAST tables.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
internally $$ strings are converted to single-quote strings. In ecpg, output newlines in commands using standard C escapes, rather than using literal newlines, which is not portable.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
have the directory for the configure test.
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
thereby sharing code with the inheritance case. This puts the UNION-ALL-view approach to partitioned tables on par with inheritance, so far as constraint exclusion is concerned: it works either way. (Still need to update the docs to say so.) The definition of "simple UNION ALL" is a little simpler than I would like --- basically the union arms can only be SELECT * FROM foo --- but it's good enough for partitioned-table cases.
-
- 03 2月, 2006 5 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
MemSet on AIX by setting MEMSET_LOOP_LIMIT to zero. Add optimization to skip MemSet tests in MEMSET_LOOP_LIMIT == 0 case and just call memset() directly.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
Disallow backslash as the delimiter in non-CVS mode. David Fetter
-
由 Bruce Momjian 提交于
Add comment about $$ and '' SCONST strings.
-
- 02 2月, 2006 6 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
> * Allow statistics collector information to be pulled from the collector > process directly, rather than requiring the collector to write a > filesystem file twice a second?
-
由 Bruce Momjian 提交于
-
- 01 2月, 2006 6 次提交
-
-
由 Bruce Momjian 提交于
Backpatch.
-
由 Bruce Momjian 提交于
it later. This fixes a problem where EXEC_BACKEND didn't have progname set, causing a segfault if log_min_messages was set below debug2 and our own snprintf.c was being used. Also alway strdup() progname. Backpatch to 8.1.X and 8.0.X.
-
由 Bruce Momjian 提交于
> * Add SQL99 WITH clause to SELECT > * Add SQL99 WITH RECURSIVE to SELECT < * Add SQL99 WITH clause to SELECT < * Add SQL99 WITH RECURSIVE to SELECT
-
由 Bruce Momjian 提交于
> > o Prevent tab completion of SET TRANSACTION from querying the > database and therefore preventing the transaction isolation > level from being set. > > Currently, SET <tab> causes a database lookup to check all > supported session variables. This query causes problems > because setting the transaction isolation level must be the > first statement of a transaction.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
inheritance trees on-the-fly, which pretty well constrained us to considering only one way of planning inheritance, expand inheritance sets during the planner prep phase, and build a side data structure that can be consulted later to find which RTEs are members of which inheritance sets. As proof of concept, use the data structure to plan joins against inheritance sets more efficiently: we can now use indexes on the set members in inner-indexscan joins. (The generated plans could be improved further, but it'll take some executor changes.) This data structure will also support handling UNION ALL subqueries in the same way as inheritance sets, but that aspect of it isn't finished yet.
-
- 31 1月, 2006 2 次提交
-
-
由 Michael Meskes 提交于
-
由 Tom Lane 提交于
constraints before FOREIGN KEY constraints that depended on them. Originally reported by Neil Conway on 29-Jun-2005. Patch by Nakano Yoshihisa.
-
- 30 1月, 2006 3 次提交
-
-
由 Tom Lane 提交于
to avoid sharing substructure with the lower-level indexquals. This is currently only an issue if there are SubPlans in the indexquals, which is uncommon but not impossible --- see bug #2218 reported by Nicholas Vinen. We use the same kluge for indexqual vs indexqualorig in the index scans themselves ... would be nice to clean this up someday.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
requested sort order. It was assuming that build_index_pathkeys always generates a pathkey per index column, which was not true if implied equality deduction had determined that two index columns were effectively equated to each other. Simplest fix seems to be to install an option that causes build_index_pathkeys to support this behavior as well as the original one. Per report from Brian Hirt.
-
- 29 1月, 2006 1 次提交
-
-
由 Andrew Dunstan 提交于
Undo perl's nasty locale setting on Windows. Since we can't do that as elsewhere by setting the environment appropriately, we make perl do it right after interpreter startup by calling its POSIX::setlocale().
-
- 28 1月, 2006 3 次提交
-
-
由 Neil Conway 提交于
memory in the executor's per-query memory context. It also inefficient: it invokes get_call_result_type() and TupleDescGetAttInMetadata() for every call to return_next, rather than invoking them once (per PL/Perl function call) and memoizing the result. This patch makes the following changes: - refactor the code to include all the "per PL/Perl function call" data inside a single struct, "current_call_data". This means we don't need to save and restore N pointers for every recursive call into PL/Perl, we can just save and restore one. - lookup the return type metadata needed by plperl_return_next() once, and then stash it in "current_call_data", so as to avoid doing the lookup for every call to return_next. - create a temporary memory context in which to evaluate the return type's input functions. This memory context is reset for each call to return_next. The patch appears to fix the memory leak, and substantially reduces the overhead imposed by return_next.
-
由 Tom Lane 提交于
one 'creating subdirectories' message instead of one per subdirectory. The original decision to print something for each subdirectory was made when there were only one or two of 'em; we have way too many now. Per discussion.
-
由 Teodor Sigaev 提交于
singlebyte encodings, so we should have snowball for every encodings. I hope that finalize multibyte support work in tsearch2, but testing is needed...
-