On Tue, May 13, 2008 at 10:34:23AM -0400, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > There's an apparently arbitary limit of 10,000,000 bytes in twophase.c
> > on the size of a two phase commit file. I can't see why this limit
> > exists.
&
There's an apparently arbitary limit of 10,000,000 bytes in twophase.c
on the size of a two phase commit file. I can't see why this limit
exists.
I hit this limit by creating a prepared transaction which included
dropping a schema with about 25,000 objects in it and then trying to
commit it. The r
On Mon, Jan 14, 2008 at 10:45:28PM -0500, Tom Lane wrote:
> Jeff Cohen <[EMAIL PROTECTED]> writes:
> > In the proposed solution, hash and list partitions work for all types
> > that support an equality operator, and range partitions work for all
> > types that support fully-ordered comparison.
On Tue, Jan 15, 2008 at 10:36:17AM -0500, Tom Lane wrote:
> Markus Schiltknecht <[EMAIL PROTECTED]> writes:
> > Jeff Cohen wrote:
> >> If you don't define a "default" partition to handle outliers, the
> >> insert should fail with an error.
>
> > IMO, you should always have a "default" partition,
On Sat, Jan 12, 2008 at 04:01:19PM +0530, NikhilS wrote:
> Hi,
>
> > We did look at allowing general functions for partitioning and this
> > was one concern. The other is that we want to enforce that a row
> > only gets inserted into a single partition, so we wanted a
> > declarative syntax where
On Sat, Jan 12, 2008 at 05:47:30PM +, Simon Riggs wrote:
> On Sat, 2008-01-12 at 01:59 +0100, Gavin Sherry wrote:
> > The syntax is half the problem, performance is the other.
>
> The syntax looks great to me, but I think it is about 5% of the problem,
> maybe less. I don
On Fri, Jan 11, 2008 at 07:46:36PM -0500, Merlin Moncure wrote:
> On Jan 11, 2008 6:19 PM, Gavin Sherry <[EMAIL PROTECTED]> wrote:
> > Hi all,
> >
> > Many of you will have read the dynamic partitioning thread here:
> >
> > http://archives.postgresql
Hi all,
Many of you will have read the dynamic partitioning thread here:
http://archives.postgresql.org/pgsql-hackers/2008-01/msg00028.php
I've proposed an alternative approach, which we've called declarative
partitioning which is grammar based. This grammar was developed by Jeff
Cohen at Greenp
On Fri, Jan 11, 2008 at 11:49:50AM +, Simon Riggs wrote:
> On Fri, 2008-01-11 at 10:25 +0100, Gavin Sherry wrote:
> > >
> > > Of course. It's an identical situation for both. Regrettably, none of
> > > your comments about dynamic partitioning and plann
On Fri, Jan 11, 2008 at 08:07:18AM +, Simon Riggs wrote:
> On Fri, 2008-01-11 at 02:28 +0100, Gavin Sherry wrote:
> > On Thu, Jan 10, 2008 at 09:30:10PM +, Simon Riggs wrote:
> > > > > We cannot perform partition exclusion using this type of WHERE clause
> &g
On Thu, Jan 10, 2008 at 09:30:10PM +, Simon Riggs wrote:
> > > We cannot perform partition exclusion using this type of WHERE clause at
> > > planning time because the CURRENT DATE function is STABLE.
> >
> > We can do the exact same thing -- if it's a direction people want to
> > take. In fa
On Thu, Jan 10, 2008 at 04:51:04PM +, Simon Riggs wrote:
> On Thu, 2008-01-10 at 03:06 +0100, Gavin Sherry wrote:
>
> > > If people with large tables like partitioning why is Oracle moving
> > > towards automated partitioning in 11g? Automated partitioning was one o
On Thu, Jan 10, 2008 at 07:25:00AM +, Simon Riggs wrote:
> On Thu, 2008-01-10 at 03:06 +0100, Gavin Sherry wrote:
> > If the exclusion is executor driven, the planner cannot help but
> > create a seq scan plan. The planner will think you're returning 100X
> > r
Hi Simon,
On Wed, Jan 09, 2008 at 03:08:08PM +, Simon Riggs wrote:
> Do people really "like" running all that DDL? There is significant
> manpower cost in implementing and maintaining a partitioning scheme,
> plus significant costs in getting it wrong.
Well... that's impossible for me to say
Hi Simon,
On Wed, Jan 02, 2008 at 05:56:14PM +, Simon Riggs wrote:
> Segment Exclusion
> -
>
> After we note that a segment is read-only we can scan the segment and
> record min/max values for all columns. These are then "implicit
> constraints", which can then be used for seg
On Wed, Jan 09, 2008 at 08:51:30PM +, Simon Riggs wrote:
> > That's what I would have done if it was easier to do with constraint
> > exclusion
> > (did only date partitioning), as the reporting queries will always have
> > some
> > server (stats by services, each service being installed on
On Wed, Jan 09, 2008 at 08:17:41PM +, Simon Riggs wrote:
> On Wed, 2008-01-09 at 20:03 +0100, Gavin Sherry wrote:
>
> > I think Simon's approach is
> > probably more complex from an implementation POV.
>
> Much of the implementation is exactly the same, and I&#
On Wed, Jan 09, 2008 at 02:38:21PM -0500, Chris Browne wrote:
> Ron Mayer <[EMAIL PROTECTED]> writes:
> > Or am I missing something?
>
> Well, this can head in two directions...
>
> 1. Suppose we're not using an "organize in CLUSTER order" approach.
>
> If the data is getting added in roughly "
On Wed, Jan 09, 2008 at 11:47:31AM -0500, Chris Browne wrote:
> [EMAIL PROTECTED] (Simon Riggs) writes:
> > I think we have an opportunity to bypass the legacy-of-thought that
> > Oracle has left us and implement something more usable.
>
> This seems like a *very* good thing to me, from a couple o
On Wed, Jan 02, 2008 at 05:56:14PM +, Simon Riggs wrote:
> This technique would be useful for any table with historical data keyed
> by date or timestamp. It would also be useful for data where a
> time-of-insert component is implicit, such as many major entity tables
> where the object ids are
On Wed, Dec 12, 2007 at 08:26:16PM +0100, Markus Schiltknecht wrote:
> >>Isn't Gavin Sherry working on this? Haven't read anything from him
> >>lately...
> >
> >Me neither. Swallowed by Greenplum and France.
>
> Hm.. good for him, I guess!
Yes
On Mon, 9 Apr 2007, Tom Lane wrote:
> We put in a workaround a long time ago to make it possible to tell the
> difference between btree and hash special space, which are also the same
> size: there's an unused 16 bits in hash special space that we fill with
> a specific value. As of 8.2 this does
On Sat, 7 Apr 2007, Mark Kirkwood wrote:
> Mark Kirkwood wrote:
> bitmap=# SELECT count(*) FROM bitmaptest
> WHERE val1 in (1,7)
> AND val0 IN (4,3)
> ;
>
> ERROR: XX000: unknown stream type 2
> LOCATION: stream_add_node, tidbitmap.c:1033
Thanks. Turned out t
> I'm seeing a segfault on a size TPC-H size 10 database. The patch and
> code are:
> - bitmap patch from 12 Mar
> - 8.3 dev from 27 Mar
Thanks Mark. I tracked this down. I'll post a new patch soon.
Gavin
---(end of broadcast)---
TIP 6: explain an
I am currently finishing off an improved VACUUM implementation for
bitmaps. The rest of the patch is ready for review.
I will try and post a patch within 24 hours.
Gavin
---(end of broadcast)---
TIP 2: Don't 'kill -9' the postmaster
On Tue, 20 Mar 2007, Joshua D. Drake wrote:
> Hackers et al... I was wondering if there are any outstanding issues
> that need to be resolved in terms of the clustered index/bitmap changes?
>
> >From the testing that I have done, plus a couple of others it is a net
> win (at least from DBA space).
On Sat, 10 Mar 2007, Chuck McDevitt wrote:
> Ok...
>
> Just to be clear, the ISO SQL spec says that INTERVAL '1' DAY is the
> correct way to specify a one-day interval.
> That's why it is surprising that PostgreSQL treats it differently, with
> no error or warning.
>
> The PostgreSQL syntax INTER
On Thu, 8 Mar 2007, Heikki Linnakangas wrote:
> Hi Gavin,
>
> Any progress?
>
Really busy at the moment, but it's on my TODO list for today.
Thanks,
Gavin
---(end of broadcast)---
TIP 1: if posting/reading through Usenet, please send an appropria
On Wed, 7 Mar 2007, Josh Berkus wrote:
> "Approximate queries" is something with DSS users *want*. Jim Grey addressed
> this in his ACM editiorial on the databases of the future. It's something
> that *I* want, and if the Greenplum people aren't speaking up here, it's
> because they're not payin
On Tue, 6 Mar 2007, Alvaro Herrera wrote:
> Also, keep in mind that there were plenty of changes in the executor.
> This stuff is not likely to be very easy to implement efficiently using
> our extant executor machinery; note that Ranbeer mentioned
> implementation of "block nested loop" and other
On Wed, 28 Feb 2007, Tom Lane wrote:
> AFAICT, the footer in question tries to make it illegal for us even to
> have the message in our mail archives. If I were running the PG lists,
> I would install filters that automatically reject mails containing such
> notices, with a message like "Your cor
Heikki,
On Mon, 5 Mar 2007, Heikki Linnakangas wrote:
> Hi all,
>
> I'd like to see the indexam API changes needed by the bitmap indexam to
> be committed soon. Has anyone looked at the proposed API in the latest
> patch? Any thoughts?
Thanks for looking at it!
>
> I'm quite happy with it mysel
On Mon, 5 Mar 2007, Mark Kirkwood wrote:
> To add a little to this - forgetting the scan resistant point for the
> moment... cranking down shared_buffers to be smaller than the L2 cache
> seems to help *any* sequential scan immensely, even on quite modest HW:
>
> e.g: PIII 1.26Ghz 512Kb L2 cache,
On Wed, 28 Feb 2007, John Bartlett wrote:
> Hi,
>
> A list of ctids is stored in the file.
I would have thought these would be stored in memory. If the set got
large, you'd use a temporary file the way other systems which overflow to
disk do?
>
> The file is used to store the ctids during an upd
On Mon, 26 Feb 2007, Heikki Linnakangas wrote:
> Hi,
>
> How are you doing with the bitmap indexes?
I need to send of a patch fixing the last bug you pointed out. The code
needs a merge of HEAD.
>
> I've been trying to get my head around the patch a couple of times to
> add the vacuum support, b
On Thu, 22 Feb 2007, Tom Lane wrote:
> Gregory Stark <[EMAIL PROTECTED]> writes:
> > If we want to minimize the pain of changing and keep the same mode of
> > operation Subversion is definitely the right choice. Its goal was to provide
> > the same operational model as CVS and fix the implementati
On Thu, 22 Feb 2007, Warren Turkal wrote:
> On Thursday 22 February 2007 00:20, Tom Lane wrote:
> > Nobody got round to it. I believe it's listed in the TODO file ...
>
> It's not at [1]. Should someone add it to the TODO?
>
> [1]http://www.postgresql.org/docs/faqs.TODO.html
Yes it is.
"Allow i
On Thu, 22 Feb 2007, Gregory Stark wrote:
> "Gavin Sherry" <[EMAIL PROTECTED]> writes:
>
> > Can you elaborate on the 'two different sets of parameters' bit? I'm still
> > without coffee.
>
> The spec allows for arbitrarily complex rec
On Wed, 21 Feb 2007, Gregory Stark wrote:
> "Gavin Sherry" <[EMAIL PROTECTED]> writes:
>
> > The WITH support seems okay. I guess I'd thought it might be represented
> > different internally (not a sub query) but the approach Greg has taken is
> > prob
On Wed, 21 Feb 2007, Jonah H. Harris wrote:
> As was discussed in several threads, I'd handed over the
> responsibility of hierarchical queries to Greg Stark several weeks
> ago. He posted a preliminary patch which I don't believe anyone
> looked at. For 8.3's sake, I wanted to make sure we get
On Sun, 18 Feb 2007, Tom Lane wrote:
> We've repeatedly discussed getting rid of execution-time access to the
> Query structure --- here's one old message about it:
> http://archives.postgresql.org/pgsql-hackers/1999-02/msg00388.php
> and here's a recent one:
> http://archives.postgresql.org/pgsql
On Thu, 8 Feb 2007, Heikki Linnakangas wrote:
> Gavin Sherry wrote:
> > I will update the code tomorrow. The focus will be cleaning up the
> > executor modifications. Please look else where for now.
>
> I'm getting a segfault with this test script:
>
> -
On Thu, 1 Feb 2007, Bruce Momjian wrote:
>
> Where are we on this patch? Does it have performance tests to show
> where it is beneificial? Is it ready to be reviewed?
Here's an updated patch:
http://www.alcove.com.au/~swm/bitmap-2007-02-02.patch
In this patch, I rewrote the index build system
On Fri, 2 Feb 2007, NikhilS wrote:
> Hi,
>
> Indeed it does, apologies for not doing the entire groundwork. But what it
> also does is that it adds -O2 by default for gcc even when --enable-debug is
> specified. gdb is not able to navigate the stack traces properly with this
> optimization in plac
On Fri, 2 Feb 2007, NikhilS wrote:
> Hi,
>
> configure with --enable-debug does not seem to add "-g" to CFLAGS while
> compiling with gcc. Guess we will need to change configure.in as below:
Erm... works for me and everyone else... AFAIK.
Thanks,
Gavin
---(end of broadc
On Thu, 1 Feb 2007, Bruce Momjian wrote:
>
> Where are we on this patch? Does it have performance tests to show
> where it is beneificial? Is it ready to be reviewed?
I've got an updated patch which adds significant performance improvements
for worse case data distributions. It also contains a
On Thu, 1 Feb 2007, Chris Dunlop wrote:
> G'day hackers,
G'Day Chris,
> already - I couldn't find anything in the mail archives, but
> that doesn't mean it's not there...)
There has been a lot of discussion about this kind of thing over the
years.
> The main idea is that, there might be space
On Thu, 25 Jan 2007, Magnus Hagander wrote:
> I'm looking over the VC build trying to eliminate what warnings are
> left. One thing that appears in a couple of places is stuff like:
>
> .\src\bin\psql\print.c(2014): warning C4090: 'function' : different
> 'const' qualifiers
Seems like other proje
On Wed, 24 Jan 2007, Sorin Schwimmer wrote:
> Dear Developers,
>
> I would like to suggest the inclusion of an extension
> in PostgreSQL. There are instances, I found, when one
> needs to INSERT several times the same record in a
> table. The front-end application can do it easy in a
> loop of a s
On Sat, 20 Jan 2007, Gregory Stark wrote:
> However for RANGE UNBOUNDED PRECEDING we can apply a different plan. Keep the
> state variable for each window aggregate around for the entire time. For each
> record apply the state transition function then apply the FINAL function to
> generate the res
On Sat, 20 Jan 2007, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > We want to answer the following: for each employee: what is their rank in
> > terms of salary and what is their rank in terms of age. This query
> > answers that:
>
> > select
On Sat, 20 Jan 2007, Simon Riggs wrote:
> On Sat, 2007-01-20 at 15:58 +1100, Gavin Sherry wrote:
> > On Fri, 19 Jan 2007, Tom Lane wrote:
> >
> > > Gavin Sherry <[EMAIL PROTECTED]> writes:
> > > > On Fri, 19 Jan 2007, Tom Lane wrote:
> > > >&
On Fri, 19 Jan 2007, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > On Fri, 19 Jan 2007, Tom Lane wrote:
> >> Er, what primary key would that be exactly? And even if you had a key,
> >> I wouldn't call joining on it trivial; I'd cal
On Sat, 19 Jan 2007, Karen Hill wrote:
> Gavin Sherry wrote:
> > Recenly, I've been researching and putting together a proposal for window
> > functions.
>
> Implementing NULLS FIRST and NULLS LAST appears like another
> challenging step to getting window fu
On Fri, 19 Jan 2007, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > What we want to do is have a kind of 'sub plan' for each aggregate. In
> > effect, the plan might start looking like a directed graph. Here is part
>
Recenly, I've been researching and putting together a proposal for window
functions. I have not finished this but when I do, I will post it. A nice
list of examples can be found here[1].
Rather than spend a lot of time talking about the problems window
functions present to the planner and executor
On Wed, 17 Jan 2007, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > I was thinking about this, but in relation to hash joins. A hash join
> > cannot be guaranteed to produce output sorted according to the pathkey of
> > the outer relation (as explained
On Wed, 17 Jan 2007, Tom Lane wrote:
> strict. However, we also allow equivalence clauses that appear below the
> nullable side of an outer join to form EquivalenceClasses; for these
> classes, the interpretation is that either all the values are equal, or
> all (except pseudo-constants) have gon
On Wed, 10 Jan 2007, Jim C. Nasby wrote:
> On Thu, Jan 11, 2007 at 08:04:41AM +0900, Michael Glaesemann wrote:
> > >Wouldn't there be some value to knowing whether the patch failed
> > >due to
> > >bitrot vs it just didn't work on some platforms out of the gate?
> >
> > I'm having a hard time figu
On Sun, 7 Jan 2007, Tom Lane wrote:
> Peter Eisentraut <[EMAIL PROTECTED]> writes:
> > Tom Lane wrote:
> >> Perhaps even more to the point, what makes you think that someone
> >> will notice the warning? If the docs build is one step in an
> >> automated build process, this seems unlikely.
>
> >
On Thu, 4 Jan 2007, Andrew Dunstan wrote:
> Gavin Sherry wrote:
> >
> > With PLM, you could test patches against various code branches. I'd
> > guessed Mark would want to provide this capability. Pulling branches from
> > anonvcvs regularly might be burdensome ban
On Thu, 4 Jan 2007, Andrew Dunstan wrote:
> Gavin Sherry wrote:
> > On Thu, 4 Jan 2007 [EMAIL PROTECTED] wrote:
> >
> >> 1. Pull source directly from repositories (cvs, git, etc.) PLM
> >> doesn't really track actually scm repositories. It requires
On Thu, 4 Jan 2007, Alvaro Herrera wrote:
> Gavin Sherry wrote:
> > On Thu, 4 Jan 2007 [EMAIL PROTECTED] wrote:
> >
> > > 1. Pull source directly from repositories (cvs, git, etc.) PLM
> > > doesn't really track actually scm repositories. It requires
On Thu, 4 Jan 2007 [EMAIL PROTECTED] wrote:
> 1. Pull source directly from repositories (cvs, git, etc.) PLM
> doesn't really track actually scm repositories. It requires
> directories of source code to be traversed, which are set up by
> creating mirrors.
It seems to me that a better approach
On Thu, 28 Dec 2006, Heikki Linnakangas wrote:
> ITAGAKI Takahiro wrote:
> > Hello,
> >
> > NTT staffs are working on TODO item:
> > | Create a bitmap of pages that need vacuuming
> >
> > We call the bitmap "Dead Space Map" (DSM), that allows VACUUM to scan
> > only pages that need vacuuming or fr
On Wed, 27 Dec 2006, Heikki Linnakangas wrote:
> Jie Zhang wrote:
> > The "bitmap data segment" sounds good in terms of space. The problem is that
> > one bitmap is likely to occupy more pages than before, which may hurt the
> > query performance.
>
> We could have segments of say 1/5 of page. Whe
On Wed, 27 Dec 2006, Heikki Linnakangas wrote:
> Gavin Sherry wrote:
> > On Tue, 26 Dec 2006, Heikki Linnakangas wrote:
> >> for typical bitmap index use cases and most of the needed pages should
> >> stay in memory, but could we simplify this? Why do we need the auxil
Hey Heikki,
On Tue, 26 Dec 2006, Heikki Linnakangas wrote:
> I've been skimming through the bitmap index patch...
>
> A scan needs to access at least five pages:
>
> 1. B-tree index (root+others, depending on depth)
> 2. The auxiliary heap page
> 3. bitmap index meta page
> 4. LOV page
> 5. bitma
On Mon, 18 Dec 2006, Gregory Stark wrote:
>
> I've been fooling with catalog entries here and I've obviously done something
> wrong. But I'm a bit frustrated trying to debug initdb. Because of the way it
> starts up the database in a separate process I'm finding it really hard to
> connect to the
On Wed, 18 Oct 2006, Heikki Linnakangas wrote:
> Hi,
>
> I don't want to harass you :), but what's the status with the bitmap
> index code? Is there something I can do to help?
>
Hi Heikki,
The streaming is implemented, as are range queries. I need to bring it up
to HEAD and back-patch to bizgre
On Tue, 17 Oct 2006, Tom Lane wrote:
> Dirk Lutzebaeck and I just spent a tense couple of hours trying to
> figure out why a large database Down Under wasn't coming up after being
> reloaded from a base backup plus PITR recovery. The symptoms were that
> the recovery went fine, but backend proces
On Tue, 26 Sep 2006, Heikki Linnakangas wrote:
> Looks a bit better now, though I think you need to think more about the
> encapsulation of the structs. More detailed comments below.
>
> Jie Zhang wrote:
> > Essentially, we want to have a stream bitmap object that has an iterator,
> > which will b
On Wed, 20 Sep 2006, Andrew Sullivan wrote:
> On Wed, Sep 20, 2006 at 12:54:14PM +0200, Zdenek Kotala wrote:
> > My first question is how important is downgrade for You and Your customers?
> >
> >
> > And second is how to verify that downgrade is possible?
>
> Well, one way to do it is to set up a
On Tue, 19 Sep 2006, Heikki Linnakangas wrote:
> Jie Zhang wrote:
> > Hi Heikki and all,
> >
> > Please find the latest bitmap index patch in the attachment. This patch is
> > generated against the postgresql cvs head.
> >
>
> Thanks.
>
> The handling of stream and hash bitmaps looks pretty compli
On Wed, 6 Sep 2006, Tom Lane wrote:
> Martijn van Oosterhout writes:
> > In the CVS version there is a table with this information:
> > http://developer.postgresql.org/pgdocs/postgres/view-pg-timezonenames.html
>
> Actually, what that view gives you is timezone offset abbreviations, not
> the ful
On Mon, 4 Sep 2006, Joshua D. Drake wrote:
>
> > I don't have a concrete proposal to make, but I do think that the
> > current patch-queue process is not suited to the project as it stands
> > today. Maybe if this issue-tracking stuff gets off the ground, we
> > could let developers place ACK or
On Fri, 1 Sep 2006, Tom Lane wrote:
> My feeling is that we ought to bounce bitmap indexes and updatable views
> as not being ready, accept all the contrib stuff, and try to get the
> other items done in time for a beta at, say, the end of next week.
For what it's worth, Jie and I hope to have fi
On Mon, 14 Aug 2006, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > One of the main reasons for the uglification of the executor in Jie's
> > original patch was that she wanted to avoid the inefficiency of
> > translating the on disk bitmap
On Mon, 14 Aug 2006, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > I will post an updated patch in a few days time.
>
> OK. Do you want me to work on the discussed amgetmulti change, or would
> that just be joggling your elbow at the moment?
Yes, that wo
On Mon, 14 Aug 2006, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > Attached is an update to the patch implementing bitmap indexes Jie sent
> > last week.
>
> What's the current status of this patch ... has any work been done since
> the first
On Fri, 4 Aug 2006, Bruce Momjian wrote:
> Gavin Sherry wrote:
> > On Fri, 4 Aug 2006, Bruce Momjian wrote:
> >
> > >
> > > My outlook is that it isn't a lot of _new_ things that you couldn't do
> > > before, but rather improvements of ex
On Fri, 4 Aug 2006, Bruce Momjian wrote:
>
> My outlook is that it isn't a lot of _new_ things that you couldn't do
> before, but rather improvements of existing functionality.
It seems as though the majority of things on Tom's list are new things you
couldn't do (at all easily) before.
Gavin
-
On Mon, 24 Jul 2006, Bruce Momjian wrote:
> Jie Zhang wrote:
> > > IIRC they quoted the cardinality of 1 as something that is still
> > > faster than btree for several usecases.
> > >
> > > And also for AND-s of several indexes, where indexes are BIG, your btree
> > > indexes may be almost as
On Mon, 24 Jul 2006, Golden Liu wrote:
> Updateable cursors are used as follows:
>
> begin;
> declare foo cursor for select * from bar for update;
> fetch foo;
> update bar set abc='def' where current of foo;
> fetch foo;
> delete from bar where current of foo;
> commit;
>
>
> PostgreSQL doesn't s
On Mon, 24 Jul 2006, Mark Kirkwood wrote:
> Tom Lane wrote:
> > Mark Kirkwood <[EMAIL PROTECTED]> writes:
> >> Scale factor 10 produces an accounts table of about 130 Mb. Given that
> >> most HW these days has at least 1G of ram, this probably means not much
> >> retrieval IO is tested (only check
On Sun, 23 Jul 2006, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > Is anyone else looking at this patch?
>
> It's on my list of things to look at, but so are a lot of other patches ;-)
>
> A couple of comments after a *very* fast scan through th
On Mon, 17 Jul 2006, Jie Zhang wrote:
> Hi,
>
> I have posted a patch to the CVS head for on-disk bitmap index to
> pgsql-patches. If this can get in 8.2, that would be great. Any comments and
> suggestions are welcome.
>
> I still need to add several items:
>
> (1) README file in src/backend/acce
On Thu, 20 Jul 2006, Josh Berkus wrote:
> Peter,
>
> > I don't understand how that is related. Or what a conversion utility
> > would be for that matter.
>
> Well, the main issue with changing the units of the PostgreSQL.conf file
> from a user perspective is that the numbers from you 8.0/8.1 con
On Thu, 20 Jul 2006, Peter Eisentraut wrote:
> One frequent source of confusion are the different units that the parameters
> in postgresql.conf use. shared_buffers is in 8 kB, work_mem is in 1 kB;
> bgwriter_delay is in milliseconds, checkpoint_warning is in seconds.
> Obviously, we can't change
On Sun, 16 Jul 2006, Joshua D. Drake wrote:
> Hello,
>
> However plRuby is even a stranger beast as it uses an entirely ruby
> build system. I am also fairly confident that it does not meat the
> PostgreSQL style guidelines.
Well... JDBC used its own.
>
> Is there enough interest in plRuby to ge
On Mon, 10 Jul 2006, Bruce Momjian wrote:
> Josh Berkus wrote:
> > Folks,
> >
> > For the code sprint, I'm starting off by removing the projects from
> > contrib which need to be removed by still have some usefulness. I'm not
> > exactly sure what to do with adddepends, though. It seems unlike
On Thu, 22 Jun 2006, Jonah H. Harris wrote:
> Not in all systems. A few now perform in-memory UNDO and only write
> it to disk if and when it is required.
Interesting...
>
> > Overwriting MVCC comes with its own baggage. Ask any Oracle user about
> > error ORA-01555[1]. There's also the added c
On Thu, 22 Jun 2006, Agent M wrote:
>
> On Jun 22, 2006, at 9:56 PM, Christopher Kings-Lynne wrote:
>
> >> The example is a very active web site, the flow is this:
> >> query for session information
> >> process HTTP request
> >> update session information
> >> This happens for EVERY http request.
On Mon, 13 Mar 2006, Tom Lane wrote:
> Gavin Sherry <[EMAIL PROTECTED]> writes:
> > On Sun, 12 Mar 2006, Jonah H. Harris wrote:
> >> SELECT * FROM (FINAL | NEW | OLD) TABLE (INSERT | UPDATE | DELETE)
>
> > This doesn't solve the generated keys probl
On Sun, 12 Mar 2006, Jonah H. Harris wrote:
> I was talking with Jonathan Gennick about the INS/UPD/DEL RETURNING stuff,
> and he recommended looking into the way DB2 handles similar functionality.
> After looking into it a bit, it's more inline with what Tom's suggestion was
> regarding a query f
> Gavin Sherry wrote:
> > On Wed, 21 Dec 2005, Tom Lane wrote:
> >
> > > Manuel Sugawara writes:
> > > > (Some time ago I proposed an--incomplete--patch and it was rejectd by
> > > > Karel arguing that to_char functions should behave *exac
On Wed, 1 Mar 2006, Bruce Momjian wrote:
> Jonah H. Harris wrote:
> > Hey guys,
> >
> > What's the status of the current INSERT/UPDATE/DELETE RETURNING patch? Is
> > it ready to go or does it need to be cleaned up?
>
> Uh, I don't remember seeing any patch like that. Where is it?
Omar Kilani se
On Fri, 24 Feb 2006, Michael Glaesemann wrote:
> [I neglected to cc the list in my reply earlier. Apologies to Gavin
> for the double-post.]
>
> On Feb 23, 2006, at 11:40 , Gavin Sherry wrote:
>
>
> > I do think that unit testing of areas such as data types would be
>
;s somehow computed
> per lines of code or something) is 0, which is probably the correct
> result, because our regression tests do not test charset conversions at
> all.
>
> I think the bug may be that they use function names to see what is
> actually tested ...
>
> IIRC G
On Wed, 22 Feb 2006, Shaun Thomas wrote:
> I'm in charge of a very large database, and we're using a highly
> decrepit version of Postgresql currently. After searching through the
> archives, Google, and trying out several replication engines, I have a
> question.
>
> I had originally considered
1 - 100 of 507 matches
Mail list logo
