Yes, that seems like a very appealing approach. There is plenty of
bit-space available in xinfo, and we could reserve a bit each for
nrels, nsubxacts, and nmsgs, with set meaning that an integer count of
that item is present and clear meaning that the count is omitted from
the structure
On 10.05.2011 04:43, Greg Smith wrote:
Josh Berkus wrote:
As I don't think we can change this, I think the best answer is to
tell people
Don't submit a big patch to PostgreSQL until you've done a few small
patches first. You'll regret it.
When I last did a talk about getting started writing
On 10 May 2011 02:58, Fujii Masao masao.fu...@gmail.com wrote:
Alright. I'm currently working on a proof-of-concept implementation of
that. In the meantime, any thoughts on how this should meld with the
existing latch implementation?
How about making WaitLatch monitor the file descriptor for
On 10.05.2011 11:22, Peter Geoghegan wrote:
On 10 May 2011 02:58, Fujii Masaomasao.fu...@gmail.com wrote:
Alright. I'm currently working on a proof-of-concept implementation of
that. In the meantime, any thoughts on how this should meld with the
existing latch implementation?
How about
On Tue, May 10, 2011 at 1:46 PM, Heikki Linnakangas
heikki.linnakan...@enterprisedb.com wrote:
On 10.05.2011 04:43, Greg Smith wrote:
Josh Berkus wrote:
As I don't think we can change this, I think the best answer is to
tell people
Don't submit a big patch to PostgreSQL until you've done
On 10 May 2011 09:45, Heikki Linnakangas
heikki.linnakan...@enterprisedb.com wrote:
I think we need to refactor the function into something like:
#define WL_LATCH_SET 1
#define WL_SOCKET_READABLE 2
#define WL_SOCKET_WRITEABLE 4
#define WL_TIMEOUT 8
#define WL_POSTMASTER_DEATH 16
On Tue, May 10, 2011 at 5:14 AM, Peter Geoghegan pe...@2ndquadrant.com wrote:
On 10 May 2011 09:45, Heikki Linnakangas
heikki.linnakan...@enterprisedb.com wrote:
I think we need to refactor the function into something like:
#define WL_LATCH_SET 1
#define WL_SOCKET_READABLE 2
#define
On Tue, May 10, 2011 at 3:35 AM, Leonardo Francalanci m_li...@yahoo.it wrote:
Yes, that seems like a very appealing approach. There is plenty of
bit-space available in xinfo, and we could reserve a bit each for
nrels, nsubxacts, and nmsgs, with set meaning that an integer count of
that
I don't think making xinfo shorter will save anything, because
whatever follows it is going to be a 4-byte quantity and therefore
4-byte aligned.
ups, didn't notice it.
I'll splitxinfo into:
uint16 xinfo;
uint16 presentFlags;
I guess it helps with the reading? I mean, instead
On Mon, May 9, 2011 at 10:25 PM, Merlin Moncure mmonc...@gmail.com wrote:
On Fri, May 6, 2011 at 5:47 PM, Robert Haas robertmh...@gmail.com wrote:
On Wed, Mar 30, 2011 at 8:52 AM, Heikki Linnakangas
heikki.linnakan...@enterprisedb.com wrote:
Another question:
To address the problem in
On Tue, May 10, 2011 at 8:03 AM, Leonardo Francalanci m_li...@yahoo.it wrote:
I don't think making xinfo shorter will save anything, because
whatever follows it is going to be a 4-byte quantity and therefore
4-byte aligned.
ups, didn't notice it.
I'll split xinfo into:
uint16
On Mon, May 9, 2011 at 11:58 PM, Pavel Stehule pavel.steh...@gmail.com wrote:
no - you are little bit confused :). CALL and function execution
shares nothing. There is significant differences between function and
procedure. Function is called only from executor - from some plan, and
you have
2011/5/10 Robert Haas robertmh...@gmail.com:
On Mon, May 9, 2011 at 11:58 PM, Pavel Stehule pavel.steh...@gmail.com
wrote:
no - you are little bit confused :). CALL and function execution
shares nothing. There is significant differences between function and
procedure. Function is called only
On Mon, May 9, 2011 at 10:36 PM, Merlin Moncure mmonc...@gmail.com wrote:
1. The visibility map needs to be crash-safe. The basic idea of
index-only scans is that, instead of checking the heap to find out
whether each tuple is visible, we first check the visibility map. If
the visibility map
On Tue, May 10, 2011 at 7:48 AM, Robert Haas robertmh...@gmail.com wrote:
I thought I'd explained it fairly thoroughly in the comments, but
evidently not. Suggestions for improvement are welcome.
ok. that clears it up nicely.
Here goes in more detail: Every time we insert, update, or delete
On Tue, May 10, 2011 at 8:22 AM, Robert Haas robertmh...@gmail.com wrote:
On Mon, May 9, 2011 at 10:36 PM, Merlin Moncure mmonc...@gmail.com wrote:
1. The visibility map needs to be crash-safe. The basic idea of
index-only scans is that, instead of checking the heap to find out
whether each
On Tue, May 10, 2011 at 9:45 AM, Merlin Moncure mmonc...@gmail.com wrote:
I see: here's a comment that was throwing me off:
+ /*
+ * If we didn't get the lock and it turns out we need it, we'll have
to
+ * unlock and re-lock, to avoid holding the buffer lock across an
Could somebody explain me on which methods is based ts_rank and how it works?
I would appreciate some articles, if exist.
Thanks a lot for reply.
Mark
--
View this message in context:
http://postgresql.1045698.n5.nabble.com/ts-rank-tp4384120p4384120.html
Sent from the PostgreSQL - hackers
I'd like to summarize expected issues corresponding to leaky-view and RLS
towards v9.2, and PGcon2011/Developer Meeting.
We already made consensus the leaky-view is a problem to be fixed previous
to the row-level security feature.
We know several ways to leak/infer contents of tuples to be
On Tue, May 10, 2011 at 9:59 AM, Merlin Moncure mmonc...@gmail.com wrote:
no, that wasn't my intent at all, except in the sense of wondering if
a crash-safe visibility map provides a route of displacing a lot of
hint bit i/o and by extension, making alternative approaches of doing
that,
FYI, I can help if you need javascript assistance.
---
Greg Smith wrote:
Shiv wrote:
So my exams are over now and am fully committed to the project in
terms of time. I have started compiling a sort of personal todo
2011/5/10 Robert Haas robertmh...@gmail.com:
So, what do we need in order to find our way to index-only scans?
3. Statistics. I believe that in order to accurately estimate the
cost of an index-only scan, we're going to need to know the fraction
of tuples that are on pages whose visibility
On Tue, May 10, 2011 at 10:58 AM, Cédric Villemain
cedric.villemain.deb...@gmail.com wrote:
ANALYZE can do the stats job for 'free' on the pages it collects
anyway. So that looks like a good idea.
I believe the really lazy vacuum is another topic; even if it will
improve the performance of the
2011/5/10 Robert Haas robertmh...@gmail.com:
On Tue, May 10, 2011 at 10:58 AM, Cédric Villemain
cedric.villemain.deb...@gmail.com wrote:
ANALYZE can do the stats job for 'free' on the pages it collects
anyway. So that looks like a good idea.
I believe the really lazy vacuum is another topic;
On 2011-05-10 14:48, Robert Haas wrote:
We could avoid all of this complexity - and the possibility of pinning
the visibility map page needlessly - by locking the heap buffer first
and then pinning the visibility map page if the heap page is
all-visible. However, that would involve holding the
On Tue, May 10, 2011 at 3:25 AM, Robert Haas robertmh...@gmail.com wrote:
So, what do we need in order to find our way to index-only scans?
1. The visibility map needs to be crash-safe. The basic idea of
index-only scans is that, instead of checking the heap to find out
whether each tuple
The temptation is high to estimate the cost of an index_scan(only) +
ordered(by ctid) table pages fetch if heap required. (this is what I
understood from heikki suggestion 3-4. and it makes sense). It may be
easier to implement both at once but I didn't find the branch in the
Heikki's git
On Tue, May 10, 2011 at 12:45 PM, Robert Haas robertmh...@gmail.com wrote:
On Tue, May 10, 2011 at 5:14 AM, Peter Geoghegan pe...@2ndquadrant.com
wrote:
On 10 May 2011 09:45, Heikki Linnakangas
heikki.linnakan...@enterprisedb.com wrote:
I think we need to refactor the function into
Simon Riggs si...@2ndquadrant.com wrote:
This topic has been discussed many times, yet I have never seen an
assessment that explains WHY we would want to do index-only scans.
In databases with this feature, it's not too unusual for a query
which uses just an index to run one or more orders
Simon Riggs si...@2ndquadrant.com writes:
I've got a feeling that things will go easier if we have a separate
connection for the feedback channel.
Yes, two connections, one in either direction.
That would make everything simple, nice one way connections. It would
also mean we could stream
On 10.05.2011 14:39, Peter Geoghegan wrote:
Attached is win32 implementation of the named pipe trick.
It consists of a Visual Studio 2008 solution that contains two
projects, named_pipe_trick (which represents the postmaster) and
auxiliary_backend (which represents each auxiliary process). I
On Tue, May 10, 2011 at 11:27 AM, Cédric Villemain
cedric.villemain.deb...@gmail.com wrote:
2011/5/10 Robert Haas robertmh...@gmail.com:
On Tue, May 10, 2011 at 10:58 AM, Cédric Villemain
cedric.villemain.deb...@gmail.com wrote:
ANALYZE can do the stats job for 'free' on the pages it collects
On Tue, May 10, 2011 at 11:34 AM, Jesper Krogh jes...@krogh.cc wrote:
On 2011-05-10 14:48, Robert Haas wrote:
We could avoid all of this complexity - and the possibility of pinning
the visibility map page needlessly - by locking the heap buffer first
and then pinning the visibility map page
Kevin Grittner kevin.gritt...@wicourts.gov writes:
Simon Riggs si...@2ndquadrant.com wrote:
This topic has been discussed many times, yet I have never seen an
assessment that explains WHY we would want to do index-only scans.
In databases with this feature, it's not too unusual for a query
On Tue, May 10, 2011 at 3:47 PM, Robert Haas robertmh...@gmail.com wrote:
To address the first problem, what we've talked about doing is
something along the line of freezing the tuples at the time we mark
the page all-visible, so we don't have to go back and do it again
later. Unfortunately,
On Mon, May 9, 2011 at 5:12 PM, Merlin Moncure mmonc...@gmail.com wrote:
I'd like to know if this is a strategy that merits further work...If
anybody has time/interest that is. It's getting close to the point
where I can just post it to the commit fest for review. In
particular, I'm
Robert Haas robertmh...@gmail.com writes:
On Tue, May 10, 2011 at 11:34 AM, Jesper Krogh jes...@krogh.cc wrote:
Or what is the downside for keeping it across IO? Will it block other
processes trying to read it?
Heikki might be in a better position to comment on that than I am,
since he wrote
On Tue, May 10, 2011 at 12:57 PM, Simon Riggs si...@2ndquadrant.com wrote:
Hmmm, do we really need to WAL log freezing?
Can we break down freezing into a 2 stage process, so that we can have
first stage as a lossy operation and a second stage that is WAL
logged?
That might solve the
On Tue, May 10, 2011 at 1:00 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Robert Haas robertmh...@gmail.com writes:
On Tue, May 10, 2011 at 11:34 AM, Jesper Krogh jes...@krogh.cc wrote:
Or what is the downside for keeping it across IO? Will it block other
processes trying to read it?
Heikki might
On Tue, May 10, 2011 at 12:53 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Kevin Grittner kevin.gritt...@wicourts.gov writes:
Simon Riggs si...@2ndquadrant.com wrote:
This topic has been discussed many times, yet I have never seen an
assessment that explains WHY we would want to do index-only scans.
On Mon, May 09, 2011 at 03:57:12PM -0400, Robert Haas wrote:
On Mon, May 9, 2011 at 2:58 PM, Bruce Momjian br...@momjian.us wrote:
Tom this collation stuff has seen more post-feature-commit cleanups than
I think any patch I remember. Is there anything we can learn from this?
How about
Robert Haas robertmh...@gmail.com writes:
On Tue, May 10, 2011 at 12:57 PM, Simon Riggs si...@2ndquadrant.com wrote:
Hmmm, do we really need to WAL log freezing?
That might solve the relfrozenxid problem - set the bits in the heap,
sync the heap, then update relfrozenxid once the heap is
On Tue, May 10, 2011 at 5:17 PM, Kevin Grittner
kevin.gritt...@wicourts.gov wrote:
Simon Riggs si...@2ndquadrant.com wrote:
This topic has been discussed many times, yet I have never seen an
assessment that explains WHY we would want to do index-only scans.
In databases with this feature,
On Tuesday, May 10, 2011 07:08:23 PM Ross J. Reedstrom wrote:
On Mon, May 09, 2011 at 03:57:12PM -0400, Robert Haas wrote:
On Mon, May 9, 2011 at 2:58 PM, Bruce Momjian br...@momjian.us wrote:
Tom this collation stuff has seen more post-feature-commit cleanups
than I think any patch I
On 10.05.2011 17:47, Robert Haas wrote:
On Tue, May 10, 2011 at 9:59 AM, Merlin Moncuremmonc...@gmail.com wrote:
no, that wasn't my intent at all, except in the sense of wondering if
a crash-safe visibility map provides a route of displacing a lot of
hint bit i/o and by extension, making
Tom Lane t...@sss.pgh.pa.us wrote:
Kevin Grittner kevin.gritt...@wicourts.gov writes:
Simon Riggs si...@2ndquadrant.com wrote:
This topic has been discussed many times, yet I have never seen
an assessment that explains WHY we would want to do index-only
scans.
In databases with this
On Tue, May 10, 2011 at 11:59 AM, Simon Riggs si...@2ndquadrant.com wrote:
On Mon, May 9, 2011 at 5:12 PM, Merlin Moncure mmonc...@gmail.com wrote:
I'd like to know if this is a strategy that merits further work...If
anybody has time/interest that is. It's getting close to the point
where I
Heikki Linnakangas wrote:
Well, my first patch was two-phase commit. And I had never even used
PostgreSQL before I dived into the source tree and started to work on that
Well, everyone knows you're awesome. A small percentage of the people
who write patches end up having the combination of
On Tue, May 10, 2011 at 9:47 AM, Robert Haas robertmh...@gmail.com wrote:
On Tue, May 10, 2011 at 9:59 AM, Merlin Moncure mmonc...@gmail.com wrote:
no, that wasn't my intent at all, except in the sense of wondering if
a crash-safe visibility map provides a route of displacing a lot of
hint bit
Given:
CREATE DOMAIN int_array AS int[];
The operator [] works fine in 4.1beta1:
SELECT (ARRAY[1,2,3]::int_array)[1];
proving that int_array is an array type with element type int.
It is inconsistent that other array functions and operators don't work.
On Mon, 2011-05-09 at 23:32 -0400,
On Tue, May 10, 2011 at 07:21:16PM +0200, Andres Freund wrote:
On Tuesday, May 10, 2011 07:08:23 PM Ross J. Reedstrom wrote:
On Mon, May 09, 2011 at 03:57:12PM -0400, Robert Haas wrote:
On Mon, May 9, 2011 at 2:58 PM, Bruce Momjian br...@momjian.us wrote:
Tom this collation stuff has
On Mon, May 9, 2011 at 11:32 PM, Tom Lane t...@sss.pgh.pa.us wrote:
J. Greg Davidson g...@ngender.net writes:
* Tighten casting checks for domains based on arrays (Tom Lane)
When a domain is based on an array type,..., such a domain type
is no longer allowed to match an
On Tue, May 10, 2011 at 6:02 PM, Robert Haas robertmh...@gmail.com wrote:
On Tue, May 10, 2011 at 12:57 PM, Simon Riggs si...@2ndquadrant.com wrote:
Hmmm, do we really need to WAL log freezing?
Can we break down freezing into a 2 stage process, so that we can have
first stage as a lossy
On Tue, May 10, 2011 at 1:49 PM, Simon Riggs si...@2ndquadrant.com wrote:
On Tue, May 10, 2011 at 6:02 PM, Robert Haas robertmh...@gmail.com wrote:
On Tue, May 10, 2011 at 12:57 PM, Simon Riggs si...@2ndquadrant.com wrote:
Hmmm, do we really need to WAL log freezing?
Can we break down
Robert Haas robertmh...@gmail.com writes:
On Mon, May 9, 2011 at 11:32 PM, Tom Lane t...@sss.pgh.pa.us wrote:
So we basically had three alternatives to make it better:
* downcast to the array type, which would possibly silently
break applications that were relying on the
On Tue, May 10, 2011 at 1:52 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Robert Haas robertmh...@gmail.com writes:
On Mon, May 9, 2011 at 11:32 PM, Tom Lane t...@sss.pgh.pa.us wrote:
So we basically had three alternatives to make it better:
* downcast to the array type, which would possibly
All,
Part of the trouble is in the question. Having a patch rejected is not
really a problem; it's something you should learn from. I know it can be
annoying. I get annoyed when it happens to me too. But I try to get over
it as quickly as possible, and either fix the patch, or find another
On Tue, May 10, 2011 at 6:08 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Robert Haas robertmh...@gmail.com writes:
On Tue, May 10, 2011 at 12:57 PM, Simon Riggs si...@2ndquadrant.com wrote:
Hmmm, do we really need to WAL log freezing?
That might solve the relfrozenxid problem - set the bits in the
On 10 May 2011 17:43, Heikki Linnakangas
heikki.linnakan...@enterprisedb.com wrote:
It should be an anonymous pipe that's inherited by the child process by
rather than a named pipe. Otherwise seems fine to me, as far as this proof
of concept program goes.
Alright, thanks. I'll use an
Ross J. Reedstrom reeds...@rice.edu writes:
So perhaps it was more of the This code is less ready than I thought
it was, but now that I've spent the time understanding it and the
problem, the shortest way out is forward.
Yeah, exactly. By the time I really understood how incomplete the
J. Greg Davidson g...@ngender.net wrote:
I would like to be able to program to a C or C++ SPI
which is clean, complete and type-safe. I am good at
reading API documentation in C or C++ and would be happy
to review any proposed improvements.
I want to second Andrew's post, and emphasize
On Tue, May 10, 2011 at 5:53 PM, Tom Lane t...@sss.pgh.pa.us wrote:
It's already the case that we'll flip over to a bitmap indexscan,
and thus get rid of most/all of the random page accesses, in
situations where this is likely to be a big win. Pointing to the
performance difference in
Robert Haas robertmh...@gmail.com writes:
On Tue, May 10, 2011 at 1:52 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Robert Haas robertmh...@gmail.com writes:
On Mon, May 9, 2011 at 11:32 PM, Tom Lane t...@sss.pgh.pa.us wrote:
So we basically had three alternatives to make it better:
*
On Tue, May 10, 2011 at 6:25 PM, Kevin Grittner
kevin.gritt...@wicourts.gov wrote:
... but I share Simon's desire to see some proof before anything
gets committed.
And we agree there. In fact, I can't think of anyone in the
community who doesn't want to see that for *any* purported
On Tue, May 10, 2011 at 6:54 PM, Josh Berkus j...@agliodbs.com wrote:
Of course, there are always idiots who won't learn anything no matter
how good our process is. But if the whole submission process is
perceived to be fair and understandible, those will be a tiny minority.
The thing is, I
On mån, 2011-05-09 at 10:56 -0400, Robert Haas wrote:
I'm just shooting from the hip here, but maybe we could have a
separate (probably smaller) set of tests that are only designed to
work in a limited range of locales and/or encodings. I'm really
pleased that we now have the
The thing is, I think things are much better now than they were three
or four years ago.
Oh, no question.
If you read above in this thread, I'm not really proposing a change in
the current process, just documenting the current process. Right now
there's a gap between how sumbitters expect
On mån, 2011-05-09 at 12:42 -0400, Tom Lane wrote:
The problem we'd have is that there's no way (at present) to make such
a test pass on every platform. Windows has its own set of locale names
(which initdb fails to install as collations anyway) and we also have
the problem that OS X can be
Peter Eisentraut pete...@gmx.net writes:
On mån, 2011-05-09 at 12:42 -0400, Tom Lane wrote:
The problem we'd have is that there's no way (at present) to make such
a test pass on every platform. Windows has its own set of locale names
(which initdb fails to install as collations anyway) and
Simon Riggs si...@2ndquadrant.com wrote:
Kevin Grittner kevin.gritt...@wicourts.gov wrote:
... but I share Simon's desire to see some proof before anything
gets committed.
And we agree there. In fact, I can't think of anyone in the
community who doesn't want to see that for *any*
On Tue, May 10, 2011 at 3:09 PM, Greg Stark gsst...@mit.edu wrote:
The thing is, I think things are much better now than they were three
or four years ago. At the time the project had grown much faster than
the existing stable of developers and the rate at which patches were
being submitted
On Tue, May 10, 2011 at 3:09 PM, Peter Eisentraut pete...@gmx.net wrote:
On mån, 2011-05-09 at 10:56 -0400, Robert Haas wrote:
I'm just shooting from the hip here, but maybe we could have a
separate (probably smaller) set of tests that are only designed to
work in a limited range of locales
Darren Duncan wrote:
To follow-up, an additional feature that would be useful and resembles union
types is the variant where you could declare a union type first and then
separately other types could declare they are a member of the union. I'm
talking about loosely what mixins or
Excerpts from Bruce Momjian's message of mar may 10 16:21:36 -0400 2011:
Darren Duncan wrote:
To follow-up, an additional feature that would be useful and resembles
union
types is the variant where you could declare a union type first and then
separately other types could declare they
Alvaro Herrera wrote:
Excerpts from Bruce Momjian's message of mar may 10 16:21:36 -0400 2011:
Darren Duncan wrote:
To follow-up, an additional feature that would be useful and resembles union
types is the variant where you could declare a union type first and then
separately other types
Tom Lane wrote:
Christopher Browne cbbro...@gmail.com writes:
But people are evidently still setting packaging policies based on how
things were back in 7.3, even though that perhaps isn't necessary
anymore.
FWIW, once you get past the client versus server distinction, I think
most
On tis, 2011-05-10 at 15:17 -0400, Tom Lane wrote:
Well, that would be great, but the someone is not going to be me;
I don't do Windows.
Yeah, me neither. At least not for this release.
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your
On tis, 2011-05-10 at 15:48 -0400, Robert Haas wrote:
On Tue, May 10, 2011 at 3:09 PM, Peter Eisentraut pete...@gmx.net wrote:
Well, the result of people don't always run them is the rest of
src/test/. How much of that stuff even works anymore?
I don't know. But I'm not sure I see your
Bruce Momjian br...@momjian.us writes:
Tom Lane wrote:
here are the sizes of the built RPMs from my last build for Fedora:
-rw-r--r--. 1 tgl tgl 3839458 Apr 18 10:50
postgresql-9.0.4-1.fc13.x86_64.rpm
-rw-r--r--. 1 tgl tgl 490788 Apr 18 10:50
postgresql-contrib-9.0.4-1.fc13.x86_64.rpm
On Wed, May 4, 2011 at 5:58 PM, Alvaro Herrera alvhe...@alvh.no-ip.org wrote:
A customer came to us with this request: a way to store any data in a
column. We've gone back and forth trying to determine reasonable
implementation restrictions, safety and useful semantics for them.
I note that
A 9.1Beta1 test report from Richard Broersma (and confirmed on another
system by Mark Watson) showed up pgsql-testers this week at
http://archives.postgresql.org/pgsql-testers/2011-05/msg0.php with
the following test crashing his Windows server every time:
SELECT 'INFINITY'::TIMESTAMP;
Peter Eisentraut pete...@gmx.net writes:
I'm all for more test suites, but we should make them as widely
accessible and accessed as possible so that they get maintained.
Yeah. My preference would really be to push something like
collate.linux.utf8 into the standard regression tests, but we'd
On Tue, May 10, 2011 at 3:57 PM, Simon Riggs si...@2ndquadrant.com wrote:
On Wed, May 4, 2011 at 5:58 PM, Alvaro Herrera alvhe...@alvh.no-ip.org
wrote:
A customer came to us with this request: a way to store any data in a
column. We've gone back and forth trying to determine reasonable
On Tue, May 10, 2011 at 8:35 PM, Kevin Grittner
kevin.gritt...@wicourts.gov wrote:
Simon Riggs si...@2ndquadrant.com wrote:
Kevin Grittner kevin.gritt...@wicourts.gov wrote:
... but I share Simon's desire to see some proof before anything
gets committed.
And we agree there. In fact, I
From: Tom Lane t...@sss.pgh.pa.us
MauMau maumau...@gmail.com writes:
I've encountered one problem on Windows. I need to support running all of
my
products on one host simultaneously. Plus, I need to log messages in
syslog/event log. On Linux, I can distinguish the messages of one product
and
On 10 May 2011 23:02, Greg Smith g...@2ndquadrant.com wrote:
Why crash there only on Windows? Was the problem actually introduced above
this part of the code? These are all questions I have no answer for.
I don't find it at all surprising that there's a memory corruption bug
that only
MauMau maumau...@gmail.com writes:
MauMau maumau...@gmail.com writes:
I've encountered one problem on Windows. I need to support running all of
my
products on one host simultaneously. Plus, I need to log messages in
syslog/event log. On Linux, I can distinguish the messages of one product
Greg Smith g...@2ndquadrant.com writes:
A 9.1Beta1 test report from Richard Broersma (and confirmed on another
system by Mark Watson) showed up pgsql-testers this week at
http://archives.postgresql.org/pgsql-testers/2011-05/msg0.php with
the following test crashing his Windows server
Simon Riggs si...@2ndquadrant.com wrote:
Normally, others come forward with the why? when? questions and it
feels like there's a bit of groupthink going on here. This looks
to me like its being approached like it was a feature, but it
looks to me like a possible optimisation, so suggest we
Bruce Momjian wrote:
Tom Lane wrote:
Bruce Momjian br...@momjian.us writes:
Prior to PG 8.2, this was necessary to put the comment on the database,
but now that we have the shared comment/description table
pg_shdescription, this is not necessary.
Do we need createdb to be able to
On Wed, May 11, 2011 at 12:14 AM, Kevin Grittner
kevin.gritt...@wicourts.gov wrote:
The problem is that there are regular and fairly frequent complaints
on the list about queries which run slower than people expect
To be fair about 3/4 of them were actually complaining about the lack
of some
Robert Haas wrote:
On Mon, May 9, 2011 at 11:10 AM, Tom Lane t...@sss.pgh.pa.us wrote:
Robert Haas robertmh...@gmail.com writes:
On Sun, May 8, 2011 at 1:04 AM, Tom Lane t...@sss.pgh.pa.us wrote:
Yes, definitely. ?Perhaps summarize as rethink how we handle partially
correct
Robert Haas wrote:
Any thoughts welcome. ?Incidentally, if anyone else feels like working
on this, feel free to let me know and I'm happy to step away, from all
of it or from whatever part someone else wants to tackle. ?I'm mostly
working on this because it's something that I think we
Greg Stark wrote:
On a separate note though, Simon, I don't know what you mean by we
normally start with a problem. It's an free software project and
people are free to work on whatever interests them whether that's
because it solves a problem they have, helps a client who's paying
them, or
On Wed, May 11, 2011 at 1:47 AM, Bruce Momjian br...@momjian.us wrote:
Isn't speeding up COUNT(*) a sufficient case because it will not have to
touch the heap in many cases?
Putting aside the politics questions, count(*) is an interesting case
-- it exposes some of the unanswered questions
Tom Lane wrote:
Bruce Momjian br...@momjian.us writes:
Tom Lane wrote:
here are the sizes of the built RPMs from my last build for Fedora:
-rw-r--r--. 1 tgl tgl 3839458 Apr 18 10:50
postgresql-9.0.4-1.fc13.x86_64.rpm
-rw-r--r--. 1 tgl tgl 490788 Apr 18 10:50
Greg Stark wrote:
On Wed, May 11, 2011 at 1:47 AM, Bruce Momjian br...@momjian.us wrote:
Isn't speeding up COUNT(*) a sufficient case because it will not have to
touch the heap in many cases?
Putting aside the politics questions, count(*) is an interesting case
-- it exposes some of the
Robert Haas wrote:
So, what do we need in order to find our way to index-only scans?
1. The visibility map needs to be crash-safe. The basic idea of
index-only scans is that, instead of checking the heap to find out
whether each tuple is visible, we first check the visibility map. If
the
Greg Stark wrote:
On Wed, May 11, 2011 at 1:47 AM, Bruce Momjian br...@momjian.us wrote:
Isn't speeding up COUNT(*) a sufficient case because it will not have to
touch the heap in many cases?
Putting aside the politics questions, count(*) is an interesting case
-- it exposes some of the
I believe I've sussed the reason for the recent reports of Windows
builds crashing when asked to process 'infinity'::timestamp. It's
a bit tedious, so bear with me:
1. The immediate cause is that datebsearch() is being called with a NULL
pointer and zero count, ie, the powerup default values of
1 - 100 of 111 matches
Mail list logo
