On Aug 24, 11:09 pm, [EMAIL PROTECTED] ("Florian G. Pflug") wrote:
> Edoardo wrote:
> > On Aug 24, 4:27 pm, [EMAIL PROTECTED] ("Heikki Linnakangas")
> > wrote:
> >> Edoardo wrote:
> >>> - Google Summer of Code effort by Florian Pflug
> >>> I would like to talk about the last one: I couldn't find an
Below is a patch against Greenplum Database that fixes the problem.
- Luke
-- Forwarded Message
From: Luke Lonergan <[EMAIL PROTECTED]>
Date: Fri, 24 Aug 2007 09:25:53 -0700
To: Heikki Linnakangas <[EMAIL PROTECTED]>, Anton <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Conversation: [PERFORM] p
Hello!
I'm working on a project requiring fast query like 'does ADDRESS belongs
to SET OF NETWORKS?'. Naturally, such a query is better implemented
using PATRICIA, but building PATRICIA tree is a relatively long task and
is better to be done once, for instance, at server startup.
I'm thinkin
On Aug 25, 2007, at 11:37 AM, Alex Povolotsky wrote:
Hello!
I'm working on a project requiring fast query like 'does ADDRESS
belongs to SET OF NETWORKS?'. Naturally, such a query is better
implemented using PATRICIA, but building PATRICIA tree is a
relatively long task and is better to b
> > I still don't see it as terrifically useful functionality, given
that it's
> > just saving you 4 keystrokes ...
>
> Less than that, because the AS is optional. The only argument I've
> heard that carries much weight with me is that it eases porting from
> other DBMS's that allow this. Are
Patricia as well as other digital trees could be realized using GiST
once we'll have time and support to extend current GiST interface.
For the moment you can use SP-GiST which should have patricia implementation.
http://www.cs.purdue.edu/spgist/.
Oleg
On Sat, 25 Aug 2007, Alex Povolotsky wrote:
Alex Povolotsky <[EMAIL PROTECTED]> writes:
> I'm working on a project requiring fast query like 'does ADDRESS belongs
> to SET OF NETWORKS?'. Naturally, such a query is better implemented
> using PATRICIA, but building PATRICIA tree is a relatively long task and
> is better to be done once, for
I'm resending this without that actual patch attached, since my first
mail didn't get through. The patch can be found here:
http://soc.phlo.org/lazyxidassign.patch
Hi
Lately, there was some interest in assigning XIDs for toplevel Transactions
only when the transaction actually needs one (that is
Tom Lane wrote:
> "dx k9" <[EMAIL PROTECTED]> writes:
> > [ stuck reindex ]
> > It turns out it was a temporary database and temporary table, that just
> > wasn't there maybe it thought it was there from some type of snapshot then
> > the next minute it was gone.
>
> Hmm, there is not any filter
"Florian G. Pflug" <[EMAIL PROTECTED]> writes:
> I've spent the last few days factoring out that work, and turning it into
> a general solution. The result is this patch, which basically does the
> following
> .) It defines a special TemporaryTransactionId that is used as an xact's xid
> unt
Alvaro Herrera <[EMAIL PROTECTED]> writes:
> Tom Lane wrote:
>> Hmm, there is not any filter in ReindexDatabase() to exclude temp tables
>> of other backends, but it sure seems like there needs to be. CLUSTER
>> might have the same issue. I think we fixed this in VACUUM long ago,
>> but we need t
Tom Lane wrote:
"Florian G. Pflug" <[EMAIL PROTECTED]> writes:
I've spent the last few days factoring out that work, and turning it into
a general solution. The result is this patch, which basically does the following
.) It defines a special TemporaryTransactionId that is used as an xact's xi
"Florian G. Pflug" <[EMAIL PROTECTED]> writes:
> Tom Lane wrote:
>> [ squint... ] Why do you need that?
> I invented the TemporaryTransactionId because it seemed worthwhile to
> distinguish between backends which do not currently run a transaction
> (xid == InvalidTransactionId), and such which r
>>> On Fri, Aug 24, 2007 at 5:47 PM, in message
<[EMAIL PROTECTED]>, Greg Smith
<[EMAIL PROTECTED]> wrote:
> On Fri, 24 Aug 2007, Kevin Grittner wrote:
>
>> I would be fine with that if I could configure the back end to always write
> a
>> dirty page to the OS when it is written to shared memor
On Sat, 25 Aug 2007, Kevin Grittner wrote:
in our environment there tends to be a lot of activity on a singe court
case, and then they're done with it.
I submitted a patch to 8.3 that lets contrib/pg_buffercache show the
usage_count data for each of the buffers. It's actually pretty tiny; yo
15 matches
Mail list logo
