On Jun 11, 2007, at 4:31 AM, Alban Hertroys wrote:
Alexander Staubo wrote:
On 6/8/07, Billings, John [EMAIL PROTECTED] wrote:
If so which part of the database, and what kind of parallel
algorithms would be used?
GPUs are parallel vector processing pipelines, which as far as I can
tell
You can use pg_dump.exe to generate DDL in postgre.
see: http://www.postgresql.org/docs/8.2/interactive/app-pgdump.html
also you might check out the app in my sig for a tool that generates
full reports/documentation about any pg database.
hth, Jesse
---
Group,
I can get the function list via \df. Can someone tell me which meta table
contain the function list? Thanks!
Alfred
---(end of broadcast)---
TIP 2: Don't 'kill -9' the postmaster
Scott Marlowe wrote:
Gary Fu wrote:
hello,
I try to allocate a chunk of ids from a sequence with the following
proc. However, if I don't use the 'lock lock_table', the proc may not
work when it runs at the same time by different psql sessions. Is
there a better way without using the
Hi all,
trying to write a function to do the following:
1. select a random *unused* (see below) row from a table.
2. select 9 more rows from same table based on relation to first row
selected
3. mark these 10 rows as used and assign a group
4. goto 1
5 when all rows are used, return the set of
Hello all!
I'm working on a PHP site using Postgres as a back-end. I have an
include at the top of each page that runs the pg_connect function.
I'm implementing some temporary tables, which I understand are
destroyed automatically at the end of the session. It seems to me that
when I navigate to
On Jun 12, 2007, at 10:18 AM, Vincenzo Romano wrote:
Hi all.
I'm trying to use this wonderful feature (thanks to anyone who
suggested/committed/implemented it).
According to the documentation:
(http://www.postgresql.org/docs/8.2/interactive/sql-insert.html)
The optional RETURNING clause
On Jun 12, 2007, at 11:40 AM, Vincenzo Romano wrote:
On Tuesday 12 June 2007 16:35:05 Martijn van Oosterhout wrote:
On Tue, Jun 12, 2007 at 04:18:32PM +0200, Vincenzo Romano wrote:
Well, at least on v8.2.4 I cannot return count(*), that is the
number of lines actually inserted into the
Hello
when you start psql with switch -E, then all used sql queries are showed.
try
psql -E yourdb
\df+ yourfce
you can find all functions in pg_proc table or information_schema.routines
Regards
Pavel Stehule
2007/6/16, Alfred Zhao [EMAIL PROTECTED]:
Group,
I can get the function list
On Fri, Jun 15, 2007 at 06:47:10PM -0500, Alfred Zhao wrote:
I can get the function list via \df. Can someone tell me which meta table
contain the function list? Thanks!
http://www.postgresql.org/docs/8.2/interactive/catalog-pg-proc.html
You can see the statements that psql runs by starting
On 6/16/07, Tom Allison [EMAIL PROTECTED] wrote:
It might make an interesting project, but I would be really depressed
if I had to go buy an NVidia card instead of investing in more RAM to
optimize my performance! g
Why does it matter what kind of hardware you can (not have to) buy
to give
Thanks, John. This is very helpful in getting me on the right track. The
pg_get_constraintdef(oid) function seems to provide what's needed to
recreate the constraint. Interestingly, it doesn't include some of the
information displayed in pgAdmin (i.e. Match type, On Update, On Delete) -
At 01:26 AM 6/9/2007, Billings, John wrote:
Does anyone think that PostgreSQL could benefit from using the video
card as a parallel computing device? I'm working on a project using
Nvidia's CUDA with an 8800 series video card to handle non-graphical
algorithms. I'm curious if anyone thinks
Alexander Staubo [EMAIL PROTECTED] writes:
On 6/16/07, Tom Allison [EMAIL PROTECTED] wrote:
It might make an interesting project, but I would be really depressed
if I had to go buy an NVidia card instead of investing in more RAM to
optimize my performance! g
Why does it matter what kind of
Mark Soper [EMAIL PROTECTED] writes:
Interestingly, it doesn't include some of the
information displayed in pgAdmin (i.e. Match type, On Update, On Delete) -
pg_get_constraintdef is aware that those values are the default ...
regards, tom lane
At least in mySQL Any temporary tables are known only t the connection that
you have created e.g.
/*connected as root to localhost */
mysql CREATE TEMPORARY TABLE test.TEMP_TABLE (COL VARCHAR(20));
ERROR 1050 (42S01): Table 'temp_table' already exists
mysql SELECT * from
Hello all!
I'm working on a PHP site using Postgres as a back-end. I have an
include at the top of each page that runs the pg_connect function.
I'm implementing some temporary tables, which I understand are
destroyed automatically at the end of the session. It seems to me that
- Temp
Hi,
I've been wondering, what O/S or hardware feature would be useful for
databases?
If Postgresql developers could get the CPU and O/S makers to do
things that would make certain things easier/faster (and in the long
term) what would they be?
By long term I mean it's not something that's
Tom Lane [EMAIL PROTECTED] writes:
So you can't just claim that using a GPU might be interesting; you have to
persuade people that it's more interesting than other places where we could
spend our performance-improvement efforts.
I have a feeling something as sexy as that could attract new
The chunk to be allocated is not the same size, so to set the increment
value will not help.
I'm sometimes not that subtle, so I'd just use a BIGINT sequence. Think
about the largest chunk you'll ever get (probably less than 2^30 rows, yes
?), set this sequence increment to this very
On 16/06/2007 16:46, PFC wrote:
Also note that PHP, being PHP, sucks, and thusly, will not reconnect
persistent connections when they fail. You have to kick it a bit.
I've seen similar negative comments before on this list about PHP, and
I'm curious to know what informs them.
I use PHP
Holy Crud!
you mean to tell me I can replace:
insert into table(string) values(('one'),('two'),('three'));
select idx from table where string in ('one','two','three');
Yes.
A smart ORM library should, when you create a new database object from
form values, use INSERT RETURNING to
Seems CPU makers currently have more transistors than they know what to
do with, so they're adding cores and doing a lot of boring stuff like
SSE2, SSE3, SSE4, etc.
SSE(n) isn't useless since it speeds up stuff like video encoding by,
say, a few times.
For databases, I'd say
I did find this:
http://www.andrew.cmu.edu/user/ngm/15-823/project/Draft.pdf
But there are several reasons this seems to be a dead-end route for Postgres:
1) It's limited to in-memory sorts. Speeding up in-memory sorts by a linear
factor seems uninteresting. Anything large enough for a
I've seen similar negative comments before on this list about PHP, and
I'm curious to know what informs them.
Maybe the fact that, when I coded a database object/form library, it took
me LONGER to ensure that empty strings / NULLs / zero valued floats and
integers / etc were handled
I never used cursors before, and I'm trying to understand how to use
them well.
Postgresql doc says a cursor that encapsulates the query, and then read
the query result a few rows at a time. So, when I open a cursor, is all
the query executed and results are returned a few a time?
My doubt comes
Raymond O'Donnell wrote:
On 16/06/2007 16:46, PFC wrote:
Also note that PHP, being PHP, sucks, and thusly, will not
reconnect persistent connections when they fail. You have to kick it a
bit.
I've seen similar negative comments before on this list about PHP, and
I'm curious to know
Ottavio Campana [EMAIL PROTECTED] writes:
Postgresql doc says a cursor that encapsulates the query, and then read
the query result a few rows at a time. So, when I open a cursor, is all
the query executed
No, just enough to give you the rows you ask for. Otherwise the query
state is held open
Tom Lane wrote:
Alexander Staubo [EMAIL PROTECTED] writes:
On 6/16/07, Tom Allison [EMAIL PROTECTED] wrote:
It might make an interesting project, but I would be really depressed
if I had to go buy an NVidia card instead of investing in more RAM to
optimize my performance! g
Why does it
guys,
love both tools but php @ 2.5 *billion* google results is far more
popular than postgresql @ 25 million google results. *if* somebody's
gotto adapt it's not php. php does what it does best in a way that
stuffy academics don't get.
On 6/16/07, PFC [EMAIL PROTECTED] wrote:
PHP: very loosely
On 06/16/07 11:24, PFC wrote:
[snip]
It's a matter of mindset. PHP and Postgres have really opposite
mindsets. Python is a lot more similar to Postgres, for instance :
- Postgres, Python : strongly typed, throws an error rather than
doing funny stuff with your data, your code does
On 6/17/07, John Smith [EMAIL PROTECTED] wrote:
guys,
love both tools but php @ 2.5 *billion* google results is far more
popular than postgresql @ 25 million google results. *if* somebody's
gotto adapt it's not php. php does what it does best in a way that
stuffy academics don't get.
That's
On Saturday 16 June 2007, John Smith wrote:
guys,
love both tools but php @ 2.5 *billion* google results is far more
popular than postgresql @ 25 million google results. *if* somebody's
gotto adapt it's not php. php does what it does best in a way that
stuffy academics don't get.
Mhhh -
On 06/16/07 10:47, Lincoln Yeoh wrote:
Hi,
I've been wondering, what O/S or hardware feature would be useful for
databases?
If Postgresql developers could get the CPU and O/S makers to do things
that would make certain things easier/faster (and in the long term) what
would they be?
By
On 06/16/07 15:04, Andrej Ricnik-Bay wrote:
On 6/17/07, John Smith [EMAIL PROTECTED] wrote:
guys,
love both tools but php @ 2.5 *billion* google results is far more
popular than postgresql @ 25 million google results. *if* somebody's
gotto adapt it's not php. php does what it does best in a way
and that's not how it is?? ever tried ubuntu and saw how it looks a
bit like windows thesedays??
good luck but try getting funding/acceptance with this line i wanna
design a new tool but i don't want features from that other tool that
work in the market
let's stop blaming php if you don't know
On 6/16/07, Uwe C. Schroeder [EMAIL PROTECTED] wrote:
Mhhh - what does PHP have to do with Postgresql? Lots of pages just end
in .php, which is why the google results are so high - guess what, the
tool html hits 3.2 billion :-)
show me a database that doesn't respect html and i'll show you one
I wouldn't call Python *strongly* typed, but I do know what you mean. I
think.
It is strongly typed (string + int = error), just not statically typed
(but you saw what I mean ;)
PHP: very loosely typed, does whatever it wants
yeah php got a life of its own! sure be a lazy programmer
On 06/16/07 15:34, John Smith wrote:
On 6/16/07, Uwe C. Schroeder [EMAIL PROTECTED] wrote:
Mhhh - what does PHP have to do with Postgresql? Lots of pages just end
in .php, which is why the google results are so high - guess what, the
tool html hits 3.2 billion :-)
show me a database that
On 6/17/07, Raymond O'Donnell [EMAIL PROTECTED] wrote:
Having said that, the main gripes I would have with PHP are (i)
variables aren't strongly typed, which can bite you unless you're
careful, and (ii) you don't have to declare variables before using them,
which can also cause trouble - in
On 6/17/07, PFC [EMAIL PROTECTED] wrote:
I either use pg_query_params() which automagically handles all quoting,
or an ORM which does the same.
There is no reason to include strings in SQL statements except laziness.
MySQL does not have a mysql_query_params() for PHP, so you have to write
On Sat, Jun 16, 2007 at 09:58:27AM -0700, Ottavio Campana wrote:
At this point I'm not able to understand any more if cursor are useful
to reduce computational needs compared to running the same query each
time with limit and offset.
A cursor is generally much cheaper because you only execute
On 6/16/07, Ron Johnson [EMAIL PROTECTED] wrote:
Hardware acceleration for quickly counting the number of
set/unset/matching bits?
x86 doesn't already do that?
I don't think so. The fastest way, I believe, is to use precomputed
lookup tables. Same for finding the least/most significant
On 6/16/07, Tom Lane [EMAIL PROTECTED] wrote:
Alexander Staubo [EMAIL PROTECTED] writes:
On 6/16/07, Tom Allison [EMAIL PROTECTED] wrote:
It might make an interesting project, but I would be really depressed
if I had to go buy an NVidia card instead of investing in more RAM to
optimize my
On 06/16/07 17:05, Alexander Staubo wrote:
On 6/16/07, Ron Johnson [EMAIL PROTECTED] wrote:
Hardware acceleration for quickly counting the number of
set/unset/matching bits?
x86 doesn't already do that?
I don't think so. The fastest way, I believe, is to use precomputed
lookup tables. Same
On 6/17/07, Ron Johnson [EMAIL PROTECTED] wrote:
On 06/16/07 17:05, Alexander Staubo wrote:
On 6/16/07, Ron Johnson [EMAIL PROTECTED] wrote:
Hardware acceleration for quickly counting the number of
set/unset/matching bits?
x86 doesn't already do that?
I don't think so. The fastest way,
On Saturday 16. June 2007 23:34, Erick Papadakis wrote:
How much value you derive from a language
depends on how you use it. After playing for years with Perl, and now
with Python and Ruby, I think PHP is still where it's at.
I too have played around with Perl and Python, and use both of them for
On 6/17/07, Ron Johnson [EMAIL PROTECTED] wrote:
That's like saying that BSD or Linux should be more like
Windows because there's more Windows than Linux stuff
to be found on the web
You've not used KDE lately, have you? :)
That'll be right. I use fluxbox. :}
And while *ix might
Martijn van Oosterhout wrote:
One last question: what happens to unclosed cursors? I mean, suppose an
application opens a cursor and crashes. What happens to that cursor? Is
there a way to close idle cursors?
Cursors are attached to the transactio and session, if either ends, the
cursor
On Sat, 16 Jun 2007, Ron Johnson wrote:
Anyway... databases are always(?) IO bound. I'd try to figure out how to
make a bigger hose (or more hoses) between the spindles and the mobo.
What I keep waiting for is the drives with flash memory built-in to
mature. I would love to get reliable
50 matches
Mail list logo
