1. 04 10月, 1999 1 次提交
    • T
      Reimplement parsing and storage of default expressions and constraint · eabc714a
      Tom Lane 提交于
      expressions in CREATE TABLE.  There is no longer an emasculated expression
      syntax for these things; it's full a_expr for constraints, and b_expr
      for defaults (unfortunately the fact that NOT NULL is a part of the
      column constraint syntax causes a shift/reduce conflict if you try a_expr.
      Oh well --- at least parenthesized boolean expressions work now).  Also,
      stored expression for a column default is not pre-coerced to the column
      type; we rely on transformInsertStatement to do that when the default is
      actually used.  This means "f1 datetime default 'now'" behaves the way
      people usually expect it to.
      BTW, all the support code is now there to implement ALTER TABLE ADD
      CONSTRAINT and ALTER TABLE ADD COLUMN with a default value.  I didn't
      actually teach ALTER TABLE to call it, but it wouldn't be much work.
      eabc714a
  2. 31 8月, 1999 1 次提交
  3. 21 8月, 1999 1 次提交
    • T
      Major revision of sort-node handling: push knowledge of query · db436adf
      Tom Lane 提交于
      sort order down into planner, instead of handling it only at the very top
      level of the planner.  This fixes many things.  An explicit sort is now
      avoided if there is a cheaper alternative (typically an indexscan) not
      only for ORDER BY, but also for the internal sort of GROUP BY.  It works
      even when there is no other reason (such as a WHERE condition) to consider
      the indexscan.  It works for indexes on functions.  It works for indexes
      on functions, backwards.  It's just so cool...
      
      CAUTION: I have changed the representation of SortClause nodes, therefore
      THIS UPDATE BREAKS STORED RULES.  You will need to initdb.
      db436adf
  4. 16 8月, 1999 1 次提交
    • T
      Major planner/optimizer revision: get rid of PathOrder node type, · e6381966
      Tom Lane 提交于
      store all ordering information in pathkeys lists (which are now lists of
      lists of PathKeyItem nodes, not just lists of lists of vars).  This was
      a big win --- the code is smaller and IMHO more understandable than it
      was, even though it handles more cases.  I believe the node changes will
      not force an initdb for anyone; planner nodes don't show up in stored
      rules.
      e6381966
  5. 09 8月, 1999 1 次提交
    • B
      > > Prevent sorting if result is already sorted · 158fd5f1
      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
      158fd5f1
  6. 25 7月, 1999 1 次提交
    • T
      Clean up messy clause-selectivity code in clausesel.c; repair bug · ac4913a0
      Tom Lane 提交于
      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.)
      ac4913a0
  7. 19 7月, 1999 1 次提交
  8. 18 7月, 1999 1 次提交
  9. 16 7月, 1999 1 次提交
  10. 15 7月, 1999 1 次提交
  11. 26 5月, 1999 2 次提交
  12. 20 5月, 1999 1 次提交
  13. 19 5月, 1999 1 次提交
  14. 18 5月, 1999 1 次提交
  15. 12 5月, 1999 1 次提交
  16. 10 5月, 1999 1 次提交
  17. 25 4月, 1999 1 次提交
  18. 24 3月, 1999 1 次提交
  19. 01 3月, 1999 1 次提交
    • T
      Executor no longer cares about mergejoinop, mergerightorder, mergeleftorder, · b204d10c
      Tom Lane 提交于
      so remove them from MergeJoin node.  Hack together a partial
      solution for commuted mergejoin operators --- yesterday
      a mergejoin int4 = int8 would crash if the planner decided to
      commute it, today it works.  The planner's representation of
      mergejoins really needs a rewrite though.
      Also, further testing of mergejoin ops in opr_sanity regress test.
      b204d10c
  20. 23 2月, 1999 1 次提交
  21. 18 2月, 1999 1 次提交
  22. 15 2月, 1999 2 次提交
  23. 14 2月, 1999 1 次提交
  24. 12 2月, 1999 2 次提交
  25. 11 2月, 1999 1 次提交
  26. 10 2月, 1999 2 次提交
  27. 09 2月, 1999 1 次提交
  28. 06 2月, 1999 1 次提交
  29. 04 2月, 1999 2 次提交
  30. 02 2月, 1999 1 次提交
  31. 24 1月, 1999 1 次提交
  32. 22 1月, 1999 1 次提交
  33. 18 1月, 1999 1 次提交
    • B
      Hi! · bd8ffc6f
      Bruce Momjian 提交于
      INTERSECT and EXCEPT is available for postgresql-v6.4!
      
      The patch against v6.4 is included at the end of the current text
      (in uuencoded form!)
      
      I also included the text of my Master's Thesis. (a postscript
      version). I hope that you find something of it useful and would be
      happy if parts of it find their way into the PostgreSQL documentation
      project (If so, tell me, then I send the sources of the document!)
      
      The contents of the document are:
        -) The first chapter might be of less interest as it gives only an
           overview on SQL.
      
        -) The second chapter gives a description on much of PostgreSQL's
           features (like user defined types etc. and how to use these features)
      
        -) The third chapter starts with an overview of PostgreSQL's internal
           structure with focus on the stages a query has to pass (i.e. parser,
           planner/optimizer, executor). Then a detailed description of the
           implementation of the Having clause and the Intersect/Except logic is
           given.
      
      Originally I worked on v6.3.2 but never found time enough to prepare
      and post a patch. Now I applied the changes to v6.4 to get Intersect
      and Except working with the new version. Chapter 3 of my documentation
      deals with the changes against v6.3.2, so keep that in mind when
      comparing the parts of the code printed there with the patched sources
      of v6.4.
      
      Here are some remarks on the patch. There are some things that have
      still to be done but at the moment I don't have time to do them
      myself. (I'm doing my military service at the moment) Sorry for that
      :-(
      
      -) I used a rewrite technique for the implementation of the Except/Intersect
         logic which rewrites the query to a semantically equivalent query before
         it is handed to the rewrite system (for views, rules etc.), planner,
         executor etc.
      
      -) In v6.3.2 the types of the attributes of two select statements
         connected by the UNION keyword had to match 100%. In v6.4 the types
         only need to be familiar (i.e. int and float can be mixed). Since this
         feature did not exist when I worked on Intersect/Except it
         does not work correctly for Except/Intersect queries WHEN USED IN
         COMBINATION WITH UNIONS! (i.e. sometimes the wrong type is used for the
         resulting table. This is because until now the types of the attributes of
         the first select statement have been used for the resulting table.
         When Intersects and/or Excepts are used in combination with Unions it
         might happen, that the first select statement of the original query
         appears at another position in the query which will be executed. The reason
         for this is the technique used for the implementation of
         Except/Intersect which does a query rewrite!)
         NOTE: It is NOT broken for pure UNION queries and pure INTERSECT/EXCEPT
               queries!!!
      
      -) I had to add the field intersect_clause to some data structures
         but did not find time to implement printfuncs for the new field.
         This does NOT break the debug modes but when an Except/Intersect
         is used the query debug output will be the already rewritten query.
      
      -) Massive changes to the grammar rules for SELECT and INSERT statements
         have been necessary (see comments in gram.y and documentation for
         deatails) in order to be able to use mixed queries like
         (SELECT ... UNION (SELECT ... EXCEPT SELECT)) INTERSECT SELECT...;
      
      -) When using UNION/EXCEPT/INTERSECT you will get:
         NOTICE: equal: "Don't know if nodes of type xxx are equal".
         I did not have  time to add comparsion support for all the needed nodes,
         but the default behaviour of the function equal met my requirements.
         I did not dare to supress this message!
      
         That's the reason why the regression test for union will fail: These
         messages are also included in the union.out file!
      
      -) Somebody of you changed the union_planner() function for v6.4
         (I copied the targetlist to new_tlist and that was removed and
         replaced by a cleanup of the original targetlist). These chnages
         violated some having queries executed against views so I changed
         it back again. I did not have time to examine the differences between the
         two versions but now it works :-)
         If you want to find out, try the file queries/view_having.sql on
         both versions and compare the results . Two queries won't produce a
         correct result with your version.
      
      regards
      
          Stefan
      bd8ffc6f
  34. 20 12月, 1998 1 次提交
    • M
      · 1adb6a9d
      Marc G. Fournier 提交于
      finished cleaning up outnodes.c ...
      1adb6a9d
  35. 18 12月, 1998 1 次提交