Re: [HACKERS] How to embed postgresql?

2009-06-16 Thread dror
In addition to my last comment, if you are looking fior real embedded database then Postgress does not fit your needs unless you would like to work with it as Server mode. With H2 (or Derby) you can work in Server mode or in embbedded mode and both are much suitable for Java applications.

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Heikki Linnakangas
Robert Haas wrote: The advice in Stephen's email is also very good - in particular, whatever you come up with, you should submit performance results. Note that while --enable-profiling is very useful and profiling numbers are good to submit, you'll also want to make sure you do a build that is

Re: [HACKERS] question about meaning of character varying without length

2009-06-16 Thread Stefan Kaltenbrunner
Konstantin Izmailov wrote: Here you go: from Mail Delivery Subsystem mailer-dae...@googlemail.com mailto:mailer-dae...@googlemail.com to pgf...@gmail.com mailto:pgf...@gmail.com dateMon, Jun 15, 2009 at 9:16 PM subject Delivery Status Notification (Failure) hide details 9:16

Re: [HACKERS] Partial vacuum versus pg_class.reltuples

2009-06-16 Thread Heikki Linnakangas
(back from vacation) Tom Lane wrote: I wrote: Another interesting question is why successive vacuums aren't causing the index reltuples counts to go to zero. Shouldn't a partial vacuum result in *all* pages of the relation being marked as not needing to be examined by the next vacuum? I

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andres Freund
Hi, On 06/12/2009 07:15 AM, Robert Haas wrote: If you don't like the syntax, please argue about that on the generic explain options v2 thread. Let's try to use this thread to discuss the output format, about which I spent a good deal of time agonizing. I spent some time playing around with the

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Stephen Frost
* Robert Haas (robertmh...@gmail.com) wrote: As I look at this, another problem is that it seems to me that you're assuming that VARDATA_ANY() will return an aligned pointer, which isn't necessarily the case (see src/include/postgres.h). I believe you need to look at it more carefully. I

[HACKERS] Synch Rep: communication between backends and walsender

2009-06-16 Thread Fujii Masao
http://archives.postgresql.org/pgsql-hackers/2008-12/msg00448.php One of the major complaints about the current synch rep patch is that signals are used for communication between backends and walsender. On some platforms, a signal doesn't interrupt sleep (i.e. poll or select system call), which

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 6:30 AM, Stephen Frostsfr...@snowman.net wrote: * Robert Haas (robertmh...@gmail.com) wrote: As I look at this, another problem is that it seems to me that you're assuming that VARDATA_ANY() will return an aligned pointer, which isn't necessarily the case (see

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Greg Stark
On Tue, Jun 16, 2009 at 12:19 PM, Andres Freundand...@anarazel.de wrote: Startup-Cost1710.98/Startup-Cost Total-Cost1710.98/Total-Cost Plan-Rows72398/Plan-Rows Plan-Width4/Plan-Width Actual-Startup-Time136.595/Actual-Startup-Time Actual-Total-Time136.595/Actual-Total-Time

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Greg Stark
On Tue, Jun 16, 2009 at 1:03 PM, Robert Haasrobertmh...@gmail.com wrote: I see that... but I don't think the test in the first loop is correct.  It's based on the value of i % 4, but I'm not convinced that you know anything about the alignment at the point where i == 0. That's correct. To

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Stephen Frost
* Robert Haas (robertmh...@gmail.com) wrote: I see that... but I don't think the test in the first loop is correct. It's based on the value of i % 4, but I'm not convinced that you know anything about the alignment at the point where i == 0. Ah, you may be half right there (see below). It

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Greg Stark
On Tue, Jun 16, 2009 at 1:03 PM, Robert Haasrobertmh...@gmail.com wrote: On the flip side, I am curious as to if the arguments to a stored procedure are always aligned or not.  Never had a case to care before, but if palloc() is always going to return an aligned chunk of memory (per

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Stephen Frost
* Greg Stark (gsst...@mit.edu) wrote: There are two points here that kind of cancel each other out :) Thanks for the insight. :) Stephen signature.asc Description: Digital signature

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Greg Stark
On Tue, Jun 16, 2009 at 1:41 PM, Stephen Frostsfr...@snowman.net wrote: Ah, you may be half right there (see below).  It does appear to be assuming that char *s (or s[i == 0]) is aligned, which isn't a guarentee (in fact, it might never be right..).  If having it actually aligned is an

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andres Freund
On 06/16/2009 02:14 PM, Greg Stark wrote: On Tue, Jun 16, 2009 at 12:19 PM, Andres Freundand...@anarazel.de wrote: Startup-Cost1710.98/Startup-Cost Total-Cost1710.98/Total-Cost Plan-Rows72398/Plan-Rows Plan-Width4/Plan-Width Actual-Startup-Time136.595/Actual-Startup-Time

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 8:38 AM, Greg Starkgsst...@mit.edu wrote: On Tue, Jun 16, 2009 at 1:03 PM, Robert Haasrobertmh...@gmail.com wrote: I see that... but I don't think the test in the first loop is correct.  It's based on the value of i % 4, but I'm not convinced that you know anything

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Andrew Dunstan
Robert Haas wrote: Ooh, good point. I still don't like the 0x20 thing, but using uint32 instead of int or long is the main point, unless we support any platforms where 0x20 != ' '. All our server encodings are strictly ASCII supersets. So 0x20 is always the space character. cheers

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 8:53 AM, Andres Freundand...@anarazel.de wrote: On 06/16/2009 02:14 PM, Greg Stark wrote: On Tue, Jun 16, 2009 at 12:19 PM, Andres Freundand...@anarazel.de  wrote: Startup-Cost1710.98/Startup-Cost Total-Cost1710.98/Total-Cost Plan-Rows72398/Plan-Rows

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Jeremy Kerr
Hi all, That's correct. To check the alignment you would have to look at the actual pointer. I would suggest using the existing macros to handle alignment. Hm, though the only one I see offhand which is relevant is the moderately silly PointerIsAligned(). Still it would make the code clearer

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andres Freund
On 06/16/2009 03:22 PM, Robert Haas wrote: Well, one problem with this is that the actual values are not costs, but times, and the estimated values are not times, but costs. The planner estimates the cost of operations on an arbitrary scale where the cost of a sequential page fetch is 1.0.

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andrew Dunstan
Robert Haas wrote: 3. We have existing precedent for this design pattern in, e.g. table_to_xml http://www.postgresql.org/docs/current/interactive/functions-xml.html Tables are flat, explain output is not. If there is a relationship between the items then that needs to be expressed in

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Tom Lane
Greg Stark gsst...@mit.edu writes: On some architectures like intel accessing unaligned ints is just slow. On others (Alpha and PPC iirc?) it is an immediate bus error. To a first approximation, Intel is the *only* popular architecture that doesn't bus-error on unaligned accesses. (And I'm

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andres Freund
On 06/16/2009 03:45 PM, Andrew Dunstan wrote: 3. We have existing precedent for this design pattern in, e.g. table_to_xml http://www.postgresql.org/docs/current/interactive/functions-xml.html Tables are flat, explain output is not. Comparing Greg's approach with Robert's it seems to me that

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 9:45 AM, Andrew Dunstanand...@dunslane.net wrote: Robert Haas wrote: 3. We have existing precedent for this design pattern in, e.g. table_to_xml http://www.postgresql.org/docs/current/interactive/functions-xml.html Tables are flat, explain output is not. If there

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 10:30 AM, Andres Freundand...@anarazel.de wrote: How would you model something like: plans  plan ... /plan  plan ... /plan  ... /plans otherwise? There are potentially unlimited number of child nodes - AppendNode for example can have any number of them. Sure, you

Re: [HACKERS] Synch Rep: communication between backends and walsender

2009-06-16 Thread Greg Stark
On Tue, Jun 16, 2009 at 12:50 PM, Fujii Masaomasao.fu...@gmail.com wrote: On some platforms, a signal doesn't interrupt sleep (i.e. poll or select system call) say what? -- Gregory Stark http://mit.edu/~gsstark/resume.pdf -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Jeremy Kerr
Hi Tom, Speaking of which, what about some performance numbers? Like Heikki, I'm quite suspicious of whether there is any real-world gain to be had from this approach. Will send numbers tomorrow, with the reworked patch. Cheers, Jeremy -- Sent via pgsql-hackers mailing list

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andrew Dunstan
Robert Haas wrote: If there is a relationship between the items then that needs to be expressed in the XML structure, either by use of child nodes or attributes. Relying on the sequence of nodes, if that's what you're doing, is not a good idea, and I'm not doing that. Period, full

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andres Freund
Hi, On 06/16/2009 04:32 PM, Robert Haas wrote: On Tue, Jun 16, 2009 at 10:30 AM, Andres Freundand...@anarazel.de wrote: How would you model something like: plans plan .../plan plan .../plan ... /plans otherwise? There are potentially unlimited number of child nodes - AppendNode for

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 10:59 AM, Andrew Dunstanand...@dunslane.net wrote: Robert Haas wrote: If there is a relationship between the items then that needs to be expressed in the XML structure, either by use of child nodes or attributes. Relying on the sequence of nodes, if that's what

Re: [HACKERS] Synch Rep: communication between backends and walsender

2009-06-16 Thread Tom Lane
Greg Stark st...@enterprisedb.com writes: On Tue, Jun 16, 2009 at 12:50 PM, Fujii Masaomasao.fu...@gmail.com wrote: On some platforms, a signal doesn't interrupt sleep (i.e. poll or select system call) say what? Yup, what he said. regards, tom lane -- Sent via

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Tom Lane
Andres Freund and...@anarazel.de writes: On 06/16/2009 04:32 PM, Robert Haas wrote: Note that even in this case we DON'T rely on the ordering of the nodes. The innerplan nodes have child nodes which contain their relationship to the parent. Not in the case of Append nodes, but I fail to

[HACKERS] Uninstallation error

2009-06-16 Thread genie.japo
Hi, I've found the uninstallation error... # make uninstall : n/man7/truncate.7 /usr/local/pgsql/share/man/man7/unlisten.7 /usr/local/pgsql/share/man/man7/update.7 /usr/local/pgsql/share/man/man7/vacuum.7 /usr/local/pgsql/share/man/man7/values.7 rm: cannot remove

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andrew Dunstan
Tom Lane wrote: Andres Freund and...@anarazel.de writes: On 06/16/2009 04:32 PM, Robert Haas wrote: Note that even in this case we DON'T rely on the ordering of the nodes. The innerplan nodes have child nodes which contain their relationship to the parent. Not in the

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andrew Dunstan
Andres Freund wrote: Anyway, I think what this discussion points out is that we actually need a formal XML Schema for this output. Agreed. If helpful I can create a schema for the current format. That will give us a useful starting point. cheers andrew -- Sent via pgsql-hackers

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Greg Stark
On Tue, Jun 16, 2009 at 1:53 PM, Andres Freundand...@anarazel.de wrote: While that also looks sensible the more structured variant makes it easier to integrate additional stats which may not easily be pressed in the 'attribute' format. As a fastly contrived example you could have io statistics

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Stefan Kaltenbrunner
Jeremy Kerr wrote: Hi Tom, Speaking of which, what about some performance numbers? Like Heikki, I'm quite suspicious of whether there is any real-world gain to be had from this approach. Will send numbers tomorrow, with the reworked patch. I can easily redo my testing as well if required.

[HACKERS] GRANT ON ALL IN schema

2009-06-16 Thread Petr Jelinek
Hi all, I am thinking about implementing GRANT ON ALL TABLES IN schema TODO item. I saw many people sending proposals to the list but nobody seemed to actually do anything. I have few questions and problems to iron out before I can start the implementation. I would also like to note that I

Re: [HACKERS] postmaster recovery and automatic restart suppression

2009-06-16 Thread Czichy, Thoralf (NSN - FI/Helsinki)
hi, I am working together with Harald on this issue. Below some thoughts on why we think it should be possible to disable the postmaster-internal recovery attempt and instead have faults in the processes started by postmaster escalated to postmaster-exit. [Our typical embedded situation]

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Tom Lane
Greg Stark gsst...@mit.edu writes: I'm picturing adding a new tag, such as iostats, or actually I was thinking of dtrace. If we have separate tags for all the estimates and actual timings then any tags which come with the iostat or dtrace option would just get mixed up with the estimates and

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andrew Dunstan
Tom Lane wrote: But I'd be just as happy with a naming convention, like planner:rowcount versus actual:rowcount, etc. I don't know enough about XML usage to understand the benefits and costs of different ways of providing that kind of structure. FYI, you probably don't want this. the ':'

Re: [HACKERS] postmaster recovery and automatic restart suppression

2009-06-16 Thread Tom Lane
Czichy, Thoralf (NSN - FI/Helsinki) thoralf.czi...@nsn.com writes: I am working together with Harald on this issue. Below some thoughts on why we think it should be possible to disable the postmaster-internal recovery attempt and instead have faults in the processes started by postmaster

[HACKERS] concurrent COPY performance

2009-06-16 Thread Stefan Kaltenbrunner
Hi! I have been doing some bulk loading testing recently - mostly with a focus on answering why we are only getting a (max of) cores/2(up to around 8 cores even less with more) speedup using parallel restore. What I found is that on some fast IO-subsystem we are CPU bottlenecked on concurrent

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 12:04 PM, Tom Lanet...@sss.pgh.pa.us wrote: Greg Stark gsst...@mit.edu writes: I'm picturing adding a new tag, such as iostats, or actually I was thinking of dtrace. If we have separate tags for all the estimates and actual timings then any tags which come with the

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Tom Lane
Robert Haas robertmh...@gmail.com writes: On Tue, Jun 16, 2009 at 12:04 PM, Tom Lanet...@sss.pgh.pa.us wrote: FWIW, I like Greg's idea of subdividing the available data this way. I like it too, but I'd like to see us come up with a design that allows it to be used for all of the output

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 1:21 PM, Tom Lanet...@sss.pgh.pa.us wrote: Robert Haas robertmh...@gmail.com writes: On Tue, Jun 16, 2009 at 12:04 PM, Tom Lanet...@sss.pgh.pa.us wrote: FWIW, I like Greg's idea of subdividing the available data this way. I like it too, but I'd like to see us come up

Re: [HACKERS] [PATCH] backend: compare word-at-a-time in bcTruelen

2009-06-16 Thread Chuck McDevitt
-Original Message- From: pgsql-hackers-ow...@postgresql.org [mailto:pgsql-hackers- ow...@postgresql.org] On Behalf Of Stephen Frost Sent: Tuesday, June 16, 2009 5:47 AM To: Greg Stark Cc: Robert Haas; Jeremy Kerr; pgsql-hackers@postgresql.org; Alvaro Herrera; Stefan Kaltenbrunner;

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Tom Lane
Robert Haas robertmh...@gmail.com writes: On Tue, Jun 16, 2009 at 1:21 PM, Tom Lanet...@sss.pgh.pa.us wrote: As a concrete example of what I'm thinking about, I'd hope that PgAdmin would be able to display a graphical summary of a plan tree, and then pop up measurements associated with one of

Re: [HACKERS] GRANT ON ALL IN schema

2009-06-16 Thread Petr Jelinek
Petr Jelinek wrote: Anyway back to my thoughts about this patch. First of all I see problem with the proposed syntax. For this syntax I think TABLES (FUNCTIONS, SEQUENCES, etc) would have to be added to keywords which is problematic because there are views named tables, sequences, views in

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Robert Haas
On Tue, Jun 16, 2009 at 2:12 PM, Tom Lanet...@sss.pgh.pa.us wrote: The main point here is that we have a pretty good idea of what general-purpose client code is likely to want to do with the data, and in a lot of cases that does not translate to having to know each node type explicitly, so

Re: [HACKERS] machine-readable explain output

2009-06-16 Thread Andres Freund
On 06/16/2009 09:51 PM, Robert Haas wrote: On Tue, Jun 16, 2009 at 2:12 PM, Tom Lanet...@sss.pgh.pa.us wrote: The main point here is that we have a pretty good idea of what general-purpose client code is likely to want to do with the data, and in a lot of cases that does not translate to

Re: [HACKERS] concurrent COPY performance

2009-06-16 Thread Merlin Moncure
On Tue, Jun 16, 2009 at 12:47 PM, Stefan Kaltenbrunnerste...@kaltenbrunner.cc wrote: Hi! I have been doing some bulk loading testing recently - mostly with a focus on answering why we are only getting a (max of) cores/2(up to around 8 cores even less with more) speedup using parallel restore.

Re: [HACKERS] concurrent COPY performance

2009-06-16 Thread Andrew Dunstan
Merlin Moncure wrote: On Tue, Jun 16, 2009 at 12:47 PM, Stefan Kaltenbrunnerste...@kaltenbrunner.cc wrote: Hi! I have been doing some bulk loading testing recently - mostly with a focus on answering why we are only getting a (max of) cores/2(up to around 8 cores even less with more)

Re: [HACKERS] concurrent COPY performance

2009-06-16 Thread Kevin Grittner
Andrew Dunstan and...@dunslane.net wrote: If a table is created or truncated in the same transaction that does the load, and archiving is not on, the COPY is not WALed. Slightly off topic, but possibly relevant to the overall process: those are the same conditions under which I would love to

Re: [HACKERS] concurrent COPY performance

2009-06-16 Thread Stefan Kaltenbrunner
Merlin Moncure wrote: On Tue, Jun 16, 2009 at 12:47 PM, Stefan Kaltenbrunnerste...@kaltenbrunner.cc wrote: Hi! I have been doing some bulk loading testing recently - mostly with a focus on answering why we are only getting a (max of) cores/2(up to around 8 cores even less with more) speedup