This patch is no longer needed. We can revisit this during 8.4 to see
if it is still needed now that we have HOT.
---
ITAGAKI Takahiro wrote:
Here is a patch discussed in
This has been saved for the 8.4 release:
http://momjian.postgresql.org/cgi-bin/pgpatches_hold
---
Heikki Linnakangas wrote:
Tom Lane wrote:
Heikki Linnakangas [EMAIL PROTECTED] writes:
Maybe we should keep
This has been saved for the 8.4 release:
http://momjian.postgresql.org/cgi-bin/pgpatches_hold
---
Tom Lane wrote:
Heikki Linnakangas [EMAIL PROTECTED] writes:
Here's latest revision of Itagaki-sans Load
This has been saved for the 8.4 release:
http://momjian.postgresql.org/cgi-bin/pgpatches_hold
---
Stephen Frost wrote:
Greetings,
Please find attached a minor patch to remove the constraints that a
user
Added to TODO:
* Implement Boyer-Moore searching in strpos()
http://archives.postgresql.org/pgsql-patches/2007-08/msg00012.php
---
Pavel Ajtkulov wrote:
Hello,
this patch allow to use Knuth-Morrison-Pratt
This has been saved for the 8.4 release:
http://momjian.postgresql.org/cgi-bin/pgpatches_hold
---
Simon Riggs wrote:
On Mon, 2007-09-10 at 10:21 -0400, Tom Lane wrote:
Oleg Bartunov [EMAIL PROTECTED] writes:
On Wed, Sep 26, 2007 at 01:43:34PM +0900, ITAGAKI Takahiro wrote:
Here is a revised patch against CVS HEAD.
I fixed a bug in ECPGdeallocate_all().
Applied to CVS HEAD. I also added your example to the regression tests.
Michael
--
Michael Meskes
Email: Michael at Fam-Meskes dot De, Michael at
Hi Tom,
Tom Raney wrote:
We used spool functions from the BTree code to sort the index
tuples. Sorting is done on the hash value of the tuples. The hash
value depends on the number of primary bucket pages (henceforth
just bucket pages) that will be required to fit all the index
tuples. So,
I've applied this patch with revision to put the hook where I thought it
made sense. Attached is a modification of your dummy.c to show use of
the hook. I didn't test it heavily, but I did check that it seemed to
work with either order of calling geqo() and standard_join_search().
Alvaro Herrera wrote:
Hi Tom,
Tom Raney wrote:
We used spool functions from the BTree code to sort the index
tuples. Sorting is done on the hash value of the tuples. The hash
value depends on the number of primary bucket pages (henceforth
just bucket pages) that will be required to fit
Tom Raney [EMAIL PROTECTED] writes:
Alvaro Herrera wrote:
Just wondering, wouldn't it be enough to obtain a tuple count estimate
by using reltuples / relpages * RelationGetNumberOfBlocks, like the
planner does?
We thought of that and the verdict is still out whether it is more
costly to
Simon Riggs [EMAIL PROTECTED] writes:
As discussed on -hackers and -admin... a few minor changes, rolled into
a single patch.
I've brought this up to speed with CVS HEAD and applied it.
I was not, however, sure what your intention was with the files in
test_warm_standby.tar.gz. That's not
Gregory Stark [EMAIL PROTECTED] writes:
[ revised version of tuptoaster-fixup.patch ]
I've applied most of this. I didn't like the hardwired assumption about
minimum size to compress, and anyway you had put it in a place where it
broke the intended behavior for SET STORAGE PLAIN. I replaced it
13 matches
Mail list logo