- 25 7月, 2000 3 次提交
- 24 7月, 2000 5 次提交
-
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Philip Warner 提交于
-
由 Philip Warner 提交于
- connect as appropriate user in pg_restore with db connection - dump owner of rule in pg_dump
-
由 Tom Lane 提交于
mergejoinable qual clauses, and add them to the query quals. For example, WHERE a = b AND b = c will cause us to add AND a = c. This is necessary to ensure that it's safe to use these variables as interchangeable sort keys, which is something 7.0 knows how to do. Should provide a useful improvement in planning ability, too.
-
- 23 7月, 2000 3 次提交
-
-
由 Peter Eisentraut 提交于
Don't do config.status substitutions into the regression test makefile.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
varlena elements work now. Allow assignment to previously-nonexistent subscript position to extend array, but only for 1-D arrays and only if adjacent to existing positions (could do more if we had a way to represent nulls in arrays, but I don't want to tackle that now). Arrange for assignment of NULL to an array element in UPDATE to be a no-op, rather than setting the entire array to NULL as it used to. (Throwing an error would be a reasonable alternative, but it's never done that...) Update regress test accordingly.
-
- 22 7月, 2000 16 次提交
-
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
由 Jan Wieck 提交于
by Tom. Jan
-
由 Tom Lane 提交于
work as expected. THe underlying implementation is essentially 'SET foo = array_set(foo, 1, bar)', so we have to turn the items into nested invocations of array_set() to make it work correctly. Side effect: we now complain about 'UPDATE tab SET foo = bar, foo = baz' which is illegal per SQL92 but we didn't detect it before.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Tom Lane 提交于
a very long time.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
Remove a bunch of crufty code for large-object-based arrays, which is superseded by TOAST and likely hasn't worked in a long time anyway. Clean up array code a little, and in particular eliminate its habit of scribbling on the input array (ie, modifying the input tuple :-().
-
由 Bruce Momjian 提交于
-
由 Peter Eisentraut 提交于
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
left keys during bottom-up index build, and leave some free space instead of packing the pages to the brim (so as to avoid vast numbers of page splits during the first interactive insertions).
-
由 Tom Lane 提交于
calculation, also make it stop when it has a 'good enough' split instead of exhaustively trying all split points.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 21 7月, 2000 13 次提交
-
-
由 Bruce Momjian 提交于
-
由 Philip Warner 提交于
- Support for BLOB output from pg_dump and input via pg_restore - Support for direct DB connection in pg_restore - Fixes in support for --insert flag - pg_dump now outputs in modified OID order
-
由 Philip Warner 提交于
- Support for direct DB connection in pg_restore - Fixes in support for --insert flag - pg_dump now outputs in modified OID order - various other bug fixes
-
由 Jan Wieck 提交于
one with the plain one. Jan
-
由 Jan Wieck 提交于
in memory (plain or compressed) in the tuple returned from the heap-am. So no index will ever contain an external reference. Jan
-
由 Tom Lane 提交于
duplicate keys by letting search go to the left rather than right when an equal key is seen at an upper tree level. Fix poor choice of page split point (leading to insertion failures) that was forced by chaining logic. Don't store leftmost key in non-leaf pages, since it's not necessary. Don't create root page until something is first stored in the index, so an unused index is now 8K not 16K. (Doesn't seem to be as easy to get rid of the metadata page, unfortunately.) Massive cleanup of unreadable code, fix poor, obsolete, and just plain wrong documentation and comments. See src/backend/access/nbtree/README for the gory details.
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-