Tom Lane wrote:
We did do that (not very rigorously) during the 7.4 release cycle.
I'm not sure why we fell out of the habit again for 8.0. It seems
like a reasonable idea to me.
In the past I have suggested incrementally maintaining release.sgml (or
some plaintext version of it), rather than hav
On Tue, May 17, 2005 at 01:32:03AM -0400, Tom Lane wrote:
> Maybe what we need is some documentation about how to get started
> as a Postgres hacker --- what to read, what sort of things to tackle
> for your first hack, etc. I think the people who have been successful
> around here are the ones wh
Lamar,
> > To put it much more bluntly: PostgreSQL development (both the process
> > and the codebase) has one of the steepest learning curves around,
You haven't looked at the OpenOffice.org code.
--
Josh Berkus
Aglio Database Solutions
San Francisco
---(end of broad
Lamar Owen <[EMAIL PROTECTED]> writes:
> To put it much more bluntly: PostgreSQL development (both the process
> and the codebase) has one of the steepest learning curves around,
The backend hacking curve is certainly steep, but I wonder whether the
problem isn't largely one of people biting off m
On Mon, May 16, 2005 at 02:35:03PM -0400, Alvaro Herrera wrote:
> On Mon, May 16, 2005 at 01:25:46PM -0500, Juan Pablo Espino wrote:
>
> > I need to write a function that retrieve the name of at least one
> > table primary key, if it exists. The only argument passed to the
> > function is the tab
On Mon, 16 May 2005, Tom Lane wrote:
> On the other hand, it seems to me a client-side SO_KEEPALIVE would only
> be interesting for completely passive clients (perhaps one that sits
> waiting for NOTIFY messages?) A normal client will try to issue some
> kind of database command once in awhile
A
David Fetter <[EMAIL PROTECTED]> writes:
>> What's the next step?
> I suppose the first thing would be to look over the patches I
> mentioned and the SQL:2003 specification, then put together a
> preliminary patch and send it to -hackers.
You can get useful feedback long before having anything th
Alvaro Herrera wrote:
> On Tue, May 17, 2005 at 09:39:20AM +0800, Christopher Kings-Lynne wrote:
> >
> >
> > Bruce Momjian wrote:
> > >If people have GIST TODOs, please post them.
> >
> > Concurrency :)
>
> And WAL support.
Already there:
* Add WAL index reliability improvement to non
On Tue, May 17, 2005 at 09:39:20AM +0800, Christopher Kings-Lynne wrote:
>
>
> Bruce Momjian wrote:
> >If people have GIST TODOs, please post them.
>
> Concurrency :)
And WAL support.
--
Alvaro Herrera ()
"No necesitamos banderas
No reconocemos fronteras" (Jorge González)
-
Hannu Krosing <[EMAIL PROTECTED]> writes:
> On E, 2005-05-16 at 19:22 +0200, Dennis Bjorklund wrote:
>> Wouldn't the client also want to know that the server is not there
>> anymore? I talked to Gaetano Mendola (I think, but you never know on irc
>> :-) and he had some clients that had been hanging
On Mon, May 16, 2005 at 03:09:18PM -0700, [EMAIL PROTECTED] wrote:
> David--
>
> My boss has given me approval to put up to 8 hours per week of
> SourceLabs' time in on the SQL99 hierarchical query implementation.
That's great! :)
> (I'm free, of course, to supplement this with whatever of my ow
Bruce Momjian wrote:
If people have GIST TODOs, please post them.
Concurrency :)
---(end of broadcast)---
TIP 5: Have you checked our extensive FAQ?
http://www.postgresql.org/docs/faq
What projects have big roadmaps? The only one I can think of is
Mozilla, and we all know how well that worked (aka Firefox). In fact,
you could argue that the Mozilla focus on the roadmap blinded them to
focusing on user needs, and made the obsolete.
I have modifed the TODO HTML so the complete
If people have GIST TODOs, please post them.
---
Teodor Sigaev wrote:
> About page splitting algorithm in GiST in multikey case. For the beginning,
> page
> is splitted by calling pickSplit method of key of first column (p
On E, 2005-05-16 at 19:22 +0200, Dennis Bjorklund wrote:
> On Mon, 16 May 2005, Tom Lane wrote:
>
> > > How come we don't set SO_KEEPALIVE in libpq?
> > > Is there any reason why we wouldn't want it on?
> >
> > Is there any reason we *would* want it on? The server-side keepalive
> > should be s
Simon Riggs <[EMAIL PROTECTED]> writes:
> What is the maximum SQL statement length that the server will accept?
There is no fixed limit, short of where you start to overflow memory
and/or stack depth.
http://archives.postgresql.org/pgsql-general/2001-02/msg00776.php
regard
I wrote:
> ... Where we are losing is mostly on the actual manipulation
> of the bitmaps (particularly hash_seq_search which is done in
> tbm_begin_iterate; and it looks like memory allocation for the bitmap
> hashtables is nontrivial too). I had already had a TODO item to look
> into speeding up
On E, 2005-05-16 at 21:18 +0100, Simon Riggs wrote:
> What is the maximum SQL statement length that the server will accept?
>
> The libpq message length identifier is 4 bytes, which indicates that the
> max length is 4GB. But thats not exactly the same thing...
>
> Most other systems have a SQL r
Jeffrey Baker <[EMAIL PROTECTED]> writes:
> Change the planner/executor to use the bitmap scan in all cases where
> index order is unimportant. From my reading of the current code, the
> bitmap scan is only used in case of a join.
This is a fallacy, and I think your concern is largely mistaken.
"Mark Cave-Ayland" <[EMAIL PROTECTED]> writes:
> Sigh, so it would help if I had added the offset to the data pointer... ;)
Would you post the corrected program so people can try it on a few other
architectures? No point in reinventing the wheel, even if it is a
pretty trivial wheel.
What is the maximum SQL statement length that the server will accept?
The libpq message length identifier is 4 bytes, which indicates that the
max length is 4GB. But thats not exactly the same thing...
Most other systems have a SQL request size limit much smaller than this,
though I can't find r
On 5/16/05, Tom Lane <[EMAIL PROTECTED]> wrote:
> regression=# explain analyze select * from tenk1 where unique1 between 100
> and 1000;
> QUERY PLAN
> --
Tom Lane <[EMAIL PROTECTED]> writes:
> "Jeffrey W. Baker" <[EMAIL PROTECTED]> writes:
> > I see that Tom has already done the infrastructure work by adding
> > getmulti, but getmulti isn't used by nodeIndexscan.c, only
> > nodeBitmapIndexscan.c. Will btree index scans be executed by creating
> >
About page splitting algorithm in GiST in multikey case. For the beginning, page
is splitted by calling pickSplit method of key of first column (pickSplit method
is defined for opclass and it is a user function), then it try to find equal
values of first column in left and right pages ( gist.c
On E, 2005-05-16 at 12:12 +0100, Mark Cave-Ayland wrote:
> > -Original Message-
> > From: Mark Cave-Ayland [mailto:[EMAIL PROTECTED]
> > Sent: 16 May 2005 09:04
> > To: 'Simon Riggs'
> > Cc: 'Christopher Kings-Lynne'; 'Tom Lane'; 'Bruce Momjian';
> > 'pgsql-hackers@postgresql.org'
> > Sub
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi all,
this weekend our DB server crashed ( 7.4.x ) and the DB engine was relocated
on another server. So far so well.
Unfortunatelly most of our clients are still on a "recv" trying to
recv data from the old DB engine instance:
# netstat -anp | gr
On Mon, 2005-05-16 at 12:12 +0100, Mark Cave-Ayland wrote:
> This now gives the following (correct) result on both platforms:
> Win32: 1.8GHz P4, WinXP
> Linux: 2.8GHz Xeon, FC1
>
>
> Win32 UINT64: 0x782104059a01660 (crc0)
> ~158us
> Win32 UINT32: 0x78210405 (crc
On Monday 16 May 2005 14:07, Tom Lane wrote:
> Andrew Dunstan <[EMAIL PROTECTED]> writes:
> > This could in a sense be as simple as
> > prioritising the TODO list.
> But the TODO list could certainly be made more informative without
> getting into that swamp.
We need to prune the TODO list to ma
Juan Pablo Espino <[EMAIL PROTECTED]> writes:
> I need to write a function that retrieve the name of at least one
> table primary key, if it exists. The only argument passed to the
> function is the table name. I have thought something like this:
You need to be searching the list of indexes, not
Robert Treat <[EMAIL PROTECTED]> writes:
> One idea I've tossed around is requiring patches to include release
> notes, and then display the release notes on the web site as a "done so
> far" type of list. It doesn't get you what is under active development,
> but would get you a more up-to-date pi
On Monday 16 May 2005 14:12, Robert Treat wrote:
> On Mon, 2005-05-16 at 12:50, Lamar Owen wrote:
> > The only way in my mind to get this dynamism on the website is to make
> > the website part of the process at some level. If someone has to go
> One idea I've tossed around is requiring patches t
On Mon, 2005-05-16 at 14:35 -0400, Tom Lane wrote:
> "Jeffrey W. Baker" <[EMAIL PROTECTED]> writes:
> > It's also possible that changing the btree scan to work in
> > groups of tuples instead of single tuples would make more sense, which
> > is why I ventured two different solution to the problem.
On Mon, May 16, 2005 at 01:25:46PM -0500, Juan Pablo Espino wrote:
> I need to write a function that retrieve the name of at least one
> table primary key, if it exists. The only argument passed to the
> function is the table name. I have thought something like this:
Why mess around with a C fu
"Jeffrey W. Baker" <[EMAIL PROTECTED]> writes:
> On Mon, 2005-05-16 at 09:53 -0400, Tom Lane wrote:
>> This is a fallacy, and I think your concern is largely mistaken. Have
>> you experimented with the cases you are worried about?
> Perhaps I have not stated the problem clearly. Believe me, I ha
On P, 2005-05-15 at 23:58 -0700, Jeffrey Baker wrote:
> I'm considering one of the following courses of action:
>
> Change nodeIndexscan.c to call index_getmulti, and to handle multiple
> tuples returned. That code would sort the tuple array and store the
> tuples in the result in disk order.
Hello all
I need to write a function that retrieve the name of at least one
table primary key, if it exists. The only argument passed to the
function is the table name. I have thought something like this:
char *
give_pkey(char * table_char)
TupleDesc tupdesc;
Form_
Joe Conway wrote:
Tom Lane wrote:
Andrew Dunstan <[EMAIL PROTECTED]> writes:
Try attached ... season to taste. The bulk of it is changes for
dblink which has the dbname hardcoded.
Joe, any objections here?
Hmm, I can't find the message with the attachment, in my inbox or in
the list archives. C
On Mon, 2005-05-16 at 12:50, Lamar Owen wrote:
> >From a sidelines point of view, a developer status summary page would allow
> one to follow development without having to read every message in HACKERS.
> At this point in my work, I am unable to follow development like I once did
> (one reason
Andrew Dunstan <[EMAIL PROTECTED]> writes:
> I don't think anybody is arguing for a radical change in culture -
> certainly I would not be so presumptuous after only a couple of years
> :-) But a roadmap could be useful in many ways. It need not tie anybody
> down, if positioned right, but can
Andrew,
> down, if positioned right, but can help people to see where things are
> going, and where the gaps are. This could in a sense be as simple as
> prioritising the TODO list. Right now anybody who wants to contribute
> and looks at the list has no idea if the item is considered important or
On Mon, 2005-05-16 at 09:53 -0400, Tom Lane wrote:
> Jeffrey Baker <[EMAIL PROTECTED]> writes:
> > Change the planner/executor to use the bitmap scan in all cases where
> > index order is unimportant. From my reading of the current code, the
> > bitmap scan is only used in case of a join.
>
> T
Hi Tom,
I didn't post the sources to the list originally as I wasn't sure if the
topic were of enough interest to warrant a larger email. I've attached the
two corrected programs as a .tar.gz - crctest.c uses uint32, whereas
crctest64.c uses uint64.
Kind regards,
Mark.
Lamar Owen wrote:
Look at other major OSS
projects. They have these things in place. Even the Linux kernel has a
bugzilla (although I am not advocating bugzilla). Not to mention KDE,
Gnome, Debian..
These projects also have reasonably defined milestones for particular
releases and show sta
Tom Lane wrote:
Andrew Dunstan <[EMAIL PROTECTED]> writes:
Try attached ... season to taste. The bulk of it is changes for dblink
which has the dbname hardcoded.
Joe, any objections here?
Hmm, I can't find the message with the attachment, in my inbox or in the
list archives. Can anyone point me t
On Mon, 16 May 2005, Tom Lane wrote:
> > How come we don't set SO_KEEPALIVE in libpq?
> > Is there any reason why we wouldn't want it on?
>
> Is there any reason we *would* want it on? The server-side keepalive
> should be sufficient to get whatever useful impact it might have.
Wouldn't the cl
On Saturday 07 May 2005 16:23, Joshua D. Drake wrote:
> > What does it mean to "track" the status of something? How would the
> > status change except by discussion? What would be the point of announcing
> > the status of something without allowing people to comment?
> No one said anything about n
Tom Lane <[EMAIL PROTECTED]> writes:
> I think it would be easy to change the planner and btree to handle
> this (where "easy" means "I remember where all the skeletons are
> buried"). But I don't know the gist code hardly at all. Can anyone
> offer an informed opinion on whether gist can hand
Dennis Bjorklund <[EMAIL PROTECTED]> writes:
> How come we don't set SO_KEEPALIVE in libpq?
> Is there any reason why we wouldn't want it on?
Is there any reason we *would* want it on? The server-side keepalive
should be sufficient to get whatever useful impact it might have.
"Mark Cave-Ayland" <[EMAIL PROTECTED]> writes:
> I didn't post the sources to the list originally as I wasn't sure if the
> topic were of enough interest to warrant a larger email. I've attached the
> two corrected programs as a .tar.gz - crctest.c uses uint32, whereas
> crctest64.c uses uint64.
I
Dimitry,
> Thus another alternative to increase expressive power of query language is
> to develop its declarative (i.e. nonprocedural) part. And here we come to
> deductive database (DDB) with its logic language Datalog.
You may want to look at the work of Rada Chirkova, who has already written
Having written my thesis about deductive DBS I cannot resist giving my 2
cent.
On Mon, May 16, 2005 at 01:42:24PM +0400, Dmitriy Letuchy wrote:
> Now some words about what must be done to realize described feature. The
> simple quickest way but the way without future is to write language hand
would you please fix it, why farsi faq is not in web site?With Regards,--taghi
Discover Yahoo!
Have fun online with music videos, cool games, IM & more. Check it out!
How come we don't set SO_KEEPALIVE in libpq?
Is there any reason why we wouldn't want it on?
--
/Dennis Björklund
---(end of broadcast)---
TIP 7: don't forget to increase your free space map settings
> -Original Message-
> From: Mark Cave-Ayland [mailto:[EMAIL PROTECTED]
> Sent: 16 May 2005 09:04
> To: 'Simon Riggs'
> Cc: 'Christopher Kings-Lynne'; 'Tom Lane'; 'Bruce Momjian';
> 'pgsql-hackers@postgresql.org'
> Subject: RE: [HACKERS] Cost of XLogInsert CRC calculations
(cut)
> The
Hello all,
I have some ideas how to increase expressive power of the PostgreSQL query
language. It is not a secret that SQL is very poor to express many important
queries, and we have to use means of procedural extensions of SQL to realize
them. However this is not good idea to split query
Hello all,
I have some ideas how to increase expressive power of the PostgreSQL query
language. It is
---(end of broadcast)---
TIP 7: don't forget to increase your free space map settings
> -Original Message-
> From: Simon Riggs [mailto:[EMAIL PROTECTED]
> Sent: 12 May 2005 16:52
> To: Mark Cave-Ayland (External)
> Cc: 'Christopher Kings-Lynne'; 'Tom Lane'; 'Bruce Momjian';
> pgsql-hackers@postgresql.org
> Subject: RE: [HACKERS] Cost of XLogInsert CRC calculations
(cut)
Neil Conway wrote:
Jeffrey Baker wrote:
Would you take a patch that retained the optimized executions of plans
returning 1 tuple and also fixed the random heap problem?
Can you elaborate on what you're proposing? Obviously sorted b+-tree
output is important for a lot more than just min()/max().
58 matches
Mail list logo
