Dear Greg,
How are you?
As we talked last week, there is a bug about the "origslot" field
assertion.
TRAP: FailedAssertion("!(epqstate->origslot != ((void *)0))", File:
"execMain.c", Line: 1732)
I checked my codes and found the reason of this problem. In the original
process of "ExecModifyTabl
A few days ago I added a regression test that involves a plpgsql
function calling a sql function, which recurses back to the plpgsql
function, etc, to a depth of 10 cycles (ie 10 plpgsql function calls
and 10 sql function calls). There are three buildfarm members that
are failing with "stack depth
Greg Stark writes:
> I suppose you could use crc where our interface does allow incremental use.
Hm, that's a thought. I'm not sure though whether CRC really has the
behavior you want from a hash function, in particular that all the bits
are independent (a/k/a taking N low-order bits is a reason
On Sat, Oct 30, 2010 at 1:48 PM, Tom Lane wrote:
> Hmm, you mean use hash_any on the sequence of hash values? Interesting
> idea; but hash_any doesn't look very amenable to being invoked
> incrementally, and I don't think I want to construct a temp array with
> enough space for the hashes of all
Dimitri Fontaine writes:
> As soon as we have that ability, we are able to provide for relocatable
> extensions with the following command:
> ALTER EXTENSION ext SET SCHEMA name;
> ALTER EXTENSION ext SET SCHEMA foo TO bar;
> I think that would end the open debate about search_path vs extens
Hi,
In the road to the extension patch, we already found some parts that
have to be separated into their own patch. Here's another one. It
occurred to me while implementing the pg_extension_objects() SRF that if
we can list all objects that belong to an extension, certainly we also
are able to mov
Alpha2 has been bundled and is available at
http://developer.postgresql.org/~petere/alpha/
Please check that it is sane. I have also put a draft announcement at
the same place.
If there are no concerns, I will move them to the FTP site tomorrow
(Sunday) and send out announcements on Monday.
Greg Stark writes:
> On Sat, Oct 30, 2010 at 9:21 AM, Tom Lane wrote:
>> Thoughts? In particular, is anyone aware of a better method
>> for combining the element hash values?
> The obvious thing to do seems like it would be to feed the individual
> values back into the regular hash function.
H
On Sat, Oct 30, 2010 at 9:21 AM, Tom Lane wrote:
> Thoughts? In particular, is anyone aware of a better method
> for combining the element hash values?
>
The obvious thing to do seems like it would be to feed the individual
values back into the regular hash function.
--
greg
--
Sent via pgsq
marcin mank writes:
> On Sat, Oct 30, 2010 at 6:21 PM, Tom Lane wrote:
>> 3. To hash, apply the element type's hash function to each array
>> element. Combine these values by rotating the accumulator left
>> one bit at each step and xor'ing in the next element's hash value.
>>
>> Thoughts? In
On Sat, Oct 30, 2010 at 6:21 PM, Tom Lane wrote:
> 3. To hash, apply the element type's hash function to each array
> element. Combine these values by rotating the accumulator left
> one bit at each step and xor'ing in the next element's hash value.
>
> Thoughts? In particular, is anyone aware
I was reminded today that I'd promised to do $SUBJECT awhile back.
It's worth having so that hash joins and hash aggregation can work
on array values. I believe this is a fairly straightforward
exercise:
1. Add a hash opclass that accepts ANYARRAY, similar to the existing
btree opclass for ANYARR
Hi,
This thread died after me not implementing a new version and some potential
license problems.
I still think its worthwile (and I used it in production for some time) so I
would like to implement a version fit for the next commitfest.
The code where I started out from is under the zlib lice
Hi,
On Tuesday 19 October 2010 16:18:29 Kevin Grittner wrote:
> Andres Freund wrote:
> > Here is a proposed patch which enables cancellation of $subject.
>
> Cool. Some enhancements we'd like to do to Serializable Snapshot
> Isolation (SSI), should the base patch make it in, would require
> thi
14 matches
Mail list logo
