- 13 8月, 1999 1 次提交
-
-
由 Tom Lane 提交于
-
- 12 8月, 1999 2 次提交
-
-
由 Tom Lane 提交于
commuted (ie, the index var appears on the right). These are now handled the same way as merge and hash join quals that need to be commuted: the actual reversing of the clause only happens if we actually choose the path and generate a plan from it. Furthermore, the clause is only reversed in the 'indexqual' field of the plan, not in the 'indxqualorig' field. This allows the clause to still be recognized and removed from qpquals of upper level join plans. Also, simplify and generalize match_clause_to_indexkey; now it recognizes binary-compatible indexes for join as well as restriction clauses.
-
由 Tom Lane 提交于
contains much code that looks like it will handle indexquals with the index key on either side of the operator, in fact indexquals must have the index key on the left because of limitations of the ScanKey machinery. Perhaps someone will be motivated to fix that someday...
-
- 11 8月, 1999 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 10 8月, 1999 2 次提交
-
-
由 Tom Lane 提交于
routines that are now dead code.
-
由 Tom Lane 提交于
work under a wider range of scenarios than it did --- it formerly did not handle a multi-pass inner scan, nor cases in which the inner scan's indxqualorig or non-index qual contained outer var references. I am not sure that these limitations could be hit in the existing optimizer, but they need to be fixed for future expansion.
-
- 09 8月, 1999 12 次提交
-
-
由 Bruce Momjian 提交于
> > > > was implemented by Jan Wieck. > > His work is for ascending order cases. > > > > Here is a patch to prevent sorting also in descending > > order cases. > > Because I had already changed _bt_first() to position > > backward correctly before v6.5,this patch would work. > > Hiroshi Inoue Inoue@tpf.co.jp
-
由 Tom Lane 提交于
expression_tree_mutator.
-
由 Tom Lane 提交于
Centralize att_disbursion readout logic.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
-
由 Vadim B. Mikheev 提交于
-
由 Tom Lane 提交于
multi-scan indexscan plans; it tried to use the same table-to-index attribute mapping for all the scans, even if they used different indexes. It would klugily work as long as OR indexquals never used multikey indexes, but that's not likely to hold up much longer...
-
由 Tom Lane 提交于
walking logic with expression_tree_walker/mutator calls.
-
由 Tom Lane 提交于
to go along with expression_tree_walker. (_walker is not suitable for routines that need to alter the tree structure significantly.) Other minor cleanups in clauses.c.
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
Also, move responsibility for calling vc_abort into main xact.c list of things-to-call-at-abort. What in the world was it doing down inside of TransactionIdAbort()?
-
由 Tom Lane 提交于
was recording a disbursion of 0, not the correct value 1/numberOfRows.
-
- 08 8月, 1999 6 次提交
-
-
由 Thomas G. Lockhart 提交于
-
由 Thomas G. Lockhart 提交于
-
由 Thomas G. Lockhart 提交于
-
由 Thomas G. Lockhart 提交于
-
由 Thomas G. Lockhart 提交于
Thanks to Garr Updegraff <garru@uci.edu> for the tip.
-
由 Thomas G. Lockhart 提交于
Use refentry.sgml as a generic header for man pages through nsgmls.
-
- 07 8月, 1999 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 06 8月, 1999 5 次提交
-
-
由 Thomas G. Lockhart 提交于
Add new pages for programming languages and tcl shells.
-
由 Thomas G. Lockhart 提交于
chapter is included, not the chapter itself. Thanks to Evelyn Mitchell <efm@tummy.com> for pointing it out.
-
由 Thomas G. Lockhart 提交于
Fix rules for man pages to ensure double-pass to get cross references. Add a few new man pages.
-
由 Thomas G. Lockhart 提交于
Fix source indenting, which does not affect output. Note: still need docs on NUMERIC and DECIMAL (and let's not talk about regression tests :()
-
由 Tom Lane 提交于
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.
-
- 05 8月, 1999 3 次提交
-
-
由 Tom Lane 提交于
constant-coercion expression in the rules test.
-
由 Tom Lane 提交于
constants, not only string constants, at parse time. Get rid of parser_typecast2(), which is bogus and redundant...
-
由 Bruce Momjian 提交于
-
- 03 8月, 1999 2 次提交
- 02 8月, 1999 5 次提交
-
-
由 Michael Meskes 提交于
-
由 Tom Lane 提交于
(it should just call the given operator, not look up an = operator). Fix intltsel() so that all numeric data types are converted to double before trying to estimate where the given comparison value is in the known range of column values. intltsel() still needs work, or replacement, for non-numeric data types ... but for nonintegral numeric types it should now be delivering reasonable estimates.
-
由 Marc G. Fournier 提交于
back out last...
-
由 Marc G. Fournier 提交于
testing somethign...
-
由 Bruce Momjian 提交于
-