- 24 Jan, 2001 1 commit
-
-
Bruce Momjian authored
-
- 05 Oct, 2000 1 commit
-
-
Bruce Momjian authored
Fix misspelling of disbursion to dispersion.
-
- 08 Jun, 2000 1 commit
-
-
Bruce Momjian authored
-
- 31 May, 2000 1 commit
-
-
Peter Eisentraut authored
That means you can now set your options in either or all of $PGDATA/configuration, some postmaster option (--enable-fsync=off), or set a SET command. The list of options is in backend/utils/misc/guc.c, documentation will be written post haste. pg_options is gone, so is that pq_geqo config file. Also removed were backend -K, -Q, and -T options (no longer applicable, although -d0 does the same as -Q). Added to configure an --enable-syslog option. changed all callers from TPRINTF to elog(DEBUG)
-
- 12 Apr, 2000 1 commit
-
-
Bruce Momjian authored
-
- 22 Mar, 2000 1 commit
-
-
Tom Lane authored
costs using the inner path's parent->rows count as the number of tuples processed per inner scan iteration. This is wrong when we are using an inner indexscan with indexquals based on join clauses, because the rows count in a Relation node reflects the selectivity of the restriction clauses for that rel only. Upshot was that if join clause was very selective, we'd drastically overestimate the true cost of the join. Fix is to calculate correct output-rows estimate for an inner indexscan when the IndexPath node is created and save it in the path node. Change of path node doesn't require initdb, since path nodes don't appear in saved rules.
-
- 15 Feb, 2000 1 commit
-
-
Tom Lane authored
accesses versus sequential accesses, a (very crude) estimate of the effects of caching on random page accesses, and cost to evaluate WHERE- clause expressions. Export critical parameters for this model as SET variables. Also, create SET variables for the planner's enable flags (enable_seqscan, enable_indexscan, etc) so that these can be controlled more conveniently than via PGOPTIONS. Planner now estimates both startup cost (cost before retrieving first tuple) and total cost of each path, so it can optimize queries with LIMIT on a reasonable basis by interpolating between these costs. Same facility is a win for EXISTS(...) subqueries and some other cases. Redesign pathkey representation to achieve a major speedup in planning (I saw as much as 5X on a 10-way join); also minor changes in planner to reduce memory consumption by recycling discarded Path nodes and not constructing unnecessary lists. Minor cleanups to display more-plausible costs in some cases in EXPLAIN output. Initdb forced by change in interface to index cost estimation functions.
-
- 07 Feb, 2000 1 commit
-
-
Tom Lane authored
fields in JoinPaths --- turns out that we do need that after all :-(. Also, rearrange planner so that only one RelOptInfo is created for a particular set of joined base relations, no matter how many different subsets of relations it can be created from. This saves memory and processing time compared to the old method of making a bunch of RelOptInfos and then removing the duplicates. Clean up the jointree iteration logic; not sure if it's better, but I sure find it more readable and plausible now, particularly for the case of 'bushy plans'.
-
- 26 Jan, 2000 1 commit
-
-
Bruce Momjian authored
* Portions Copyright (c) 1996-2000, PostgreSQL, Inc to all files copyright Regents of Berkeley. Man, that's a lot of files.
-
- 23 Jan, 2000 1 commit
-
-
Tom Lane authored
selectivity estimation wasn't right. This is better...
-
- 22 Jan, 2000 1 commit
-
-
Tom Lane authored
pghackers discussion of 5-Jan-2000. The amopselect and amopnpages estimators are gone, and in their place is a per-AM amcostestimate procedure (linked to from pg_am, not pg_amop).
-
- 09 Jan, 2000 1 commit
-
-
Tom Lane authored
code cleanup; no major improvements yet. However, EXPLAIN does produce more intuitive outputs for nested loops with indexscans now...
-
- 23 Nov, 1999 1 commit
-
-
Bruce Momjian authored
-
- 06 Aug, 1999 1 commit
-
-
Tom Lane authored
hashjoinable clause, not one path for a randomly-chosen element of each set of clauses with the same join operator. That is, if you wrote SELECT ... WHERE t1.f1 = t2.f2 and t1.f3 = t2.f4, and both '=' ops were the same opcode (say, all four fields are int4), then the system would either consider hashing on f1=f2 or on f3=f4, but it would *not* consider both possibilities. Boo hiss. Also, revise estimation of hashjoin costs to include a penalty when the inner join var has a high disbursion --- ie, the most common value is pretty common. This tends to lead to badly skewed hash bucket occupancy and way more comparisons than you'd expect on average. I imagine that the cost calculation still needs tweaking, but at least it generates a more reasonable plan than before on George Young's example.
-
- 24 Jul, 1999 1 commit
-
-
Tom Lane authored
identified by Hiroshi (incorrect cost attributed to OR clauses after multiple passes through set_rest_selec()). I think the code was trying to allow selectivities of OR subclauses to be passed in from outside, but noplace was actually passing any useful data, and set_rest_selec() was passing wrong data. Restructure representation of "indexqual" in IndexPath nodes so that it is the same as for indxqual in completed IndexScan nodes: namely, a toplevel list with an entry for each pass of the index scan, having sublists that are implicitly-ANDed index qual conditions for that pass. You don't want to know what the old representation was :-( Improve documentation of OR-clause indexscan functions. Remove useless 'notclause' field from RestrictInfo nodes. (This might force an initdb for anyone who has stored rules containing RestrictInfos, but I do not think that RestrictInfo ever appears in completed plans.)
-
- 15 Jul, 1999 1 commit
-
-
Bruce Momjian authored
-
- 25 May, 1999 2 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
-
- 01 May, 1999 1 commit
-
-
Tom Lane authored
the cost of reading the source data.
-
- 13 Feb, 1999 1 commit
-
-
Bruce Momjian authored
-
- 12 Feb, 1999 2 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
-
- 10 Feb, 1999 2 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
-
- 03 Feb, 1999 1 commit
-
-
Bruce Momjian authored
-
- 01 Sep, 1998 1 commit
-
-
Bruce Momjian authored
-
- 04 Aug, 1998 1 commit
-
-
Bruce Momjian authored
it is now only mergejoin.
-
- 18 Jul, 1998 1 commit
-
-
Bruce Momjian authored
-
- 26 Feb, 1998 1 commit
-
-
Bruce Momjian authored
-
- 24 Jan, 1998 1 commit
-
-
Bruce Momjian authored
-
- 26 Nov, 1997 1 commit
-
-
Bruce Momjian authored
-
- 08 Sep, 1997 2 commits
-
-
Bruce Momjian authored
-
Bruce Momjian authored
Another PGINDENT run that changes variable indenting and case label indenting. Also static variable indenting.
-
- 07 Sep, 1997 1 commit
-
-
Bruce Momjian authored
-
- 19 Aug, 1997 1 commit
-
-
Bruce Momjian authored
-
- 28 Aug, 1996 1 commit
-
-
Marc G. Fournier authored
- code compile tested, but due to a yet unresolved problem with parse.h's creation, compile not completed...
-
- 09 Jul, 1996 1 commit
-
-
Marc G. Fournier authored
-