Horton

Commits

DateSubjectAuthorReleases
2005-06-05 Remove planner's private fields from Query struct, and put them into Tom Lane 8.1.0
2005-04-21 Rethink original decision to use AND/OR Expr nodes to represent bitmap Tom Lane 8.1.0
2003-12-30 Instead of trying to force WHERE clauses into CNF or DNF normal form, Tom Lane 8.0.0
2003-01-20 IN clauses appearing at top level of WHERE can now be handled as joins. Tom Lane 7.4.1
2003-01-15 Allow merge and hash joins to occur on arbitrary expressions (anything not Tom Lane 7.4.1
2002-11-30 Be more realistic about plans involving Materialize nodes: take their Tom Lane 7.4.1
2002-11-06 First phase of implementing hash-based grouping/aggregation. An AGG plan Tom Lane 7.4.1
2002-05-12 Get rid of long-since-vestigial Iter node type, in favor of adding a Tom Lane 7.3.1
2001-10-18 Extend code that deduces implied equality clauses to detect whether a Tom Lane 7.2.1
2000-12-14 Planner speedup hacking. Avoid saving useless pathkeys, so that path Tom Lane 7.1.1
2000-11-12 Restructure handling of inheritance queries so that they work with outer Tom Lane 7.1.1
2000-09-29 Subselects in FROM clause, per ISO syntax: FROM (SELECT ...) [AS] alias. Tom Lane 7.1.1
2000-09-12 First cut at full support for OUTER JOINs. There are still a few loose Tom Lane 7.1.1
2000-07-24 Deduce equality constraints that are implied by transitivity of Tom Lane 7.1.1
2000-03-21 Restructure planning code so that preprocessing of targetlist and quals Tom Lane 7.1.1
2000-02-15 New cost model for planning, incorporating a penalty for random page Tom Lane 7.1.1
2000-02-07 Repair planning bugs caused by my misguided removal of restrictinfo link Tom Lane 7.1.1
1999-08-16 Major planner/optimizer revision: get rid of PathOrder node type, Tom Lane 7.1.1