nts to. It's really a question of how far do we bend backwards
to accomodate Doxygen. I'd say we just stick to moving comments around and
putting in the extra '*'s. Let's not encourage people to put in Doxygen
markup that isn't obvious. If someone contributes code with Dox
uot; and
inserting/updating/deleting/selecting from that. Perhaps these are
per-session shared variables? IN which case, what is the utility if sharing
them across shared memory?
- --
Jonathan Gardner
[EMAIL PROTECTED]
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.2
d from
> OidFunctionCall4 if the selectivity of mergejoin is the one required from
> join_selectivity.
>
I'm no expert, but I can tell you from experience with the database that my
first impression is that it is calling a function in the database (stored
in pg_proc table or some
it out.
3. Param 3 is a varchar.
Does it even make sense to specify something like that?
If these questions are answered by a discussion thread from a while back,
I'd appreciate pointers.
Thanks for your time Tom and others, I'm enjoying this and r
the cart before the horse. We have to get things
working and get the rules figured out before we can start modifying the
backend. Once we get it all figured out, implemented, tested, and debugged,
then maybe we can start considering modifying the backend.
--
Jonathan Gardner
[EMAIL PROTE
char *name, char *stmt);
PGpreparedStmt *PQgetPrepare(PGconn *);
The naming could be better. I can't think of any good alternatives right
now.
I'll look into how to actually implement this at home tonight.
--
Jonathan Gardner
[EMAIL PROTECTED]
---(end of broad
in a future
release.
Does the new, 8.0 libpq have an interface to the prepare protocol message?
--
Jonathan Gardner
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 2: you can get off all lists at once with the unregister command
(send "unregister YourEmailAddressHere" to [EMAIL PROTECTED])
27;t the way things have been done. I know that one of the
arguments against proposals like this is that it seperates out our pool of
developers. Yes, it will do that. But it will also open up development to
more people and more experimentation. Maybe in the end, we will have a
stable and
ading code around the parts you are interested in.
I have also found that watching the patches come in will give you a feel for
what is happening. Not only do you see the actual code, but you can watch
the experts talk about it. You can read through the code and then watch as
the server behave
know of good resources on learning how transactions are implemented
in PostgreSQL? Should I just peruse the code? Which files are most
relevant?
--
Jonathan Gardner
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 9: the planner will ignore your
On Wednesday 02 June 2004 02:01 pm, ivan wrote:
>
> where can i set min/max number of process which are waiting for
> connections from clients ?
>
First off, you are on the wrong list. This is more appropriate for the admin
or preformance list.
PostgreSQL forks a proce
On Monday 31 May 2004 06:38 am, Pierre Emmanuel Gros wrote:
> Hi,
> I would like to know if i can add constraint and typed column upon a
> create view sentence.
> something like create view toto (a INTEGER primary key , b VARCHAR) as
> select .
> If it is not possible , what t
On Friday 28 May 2004 04:08 pm, [EMAIL PROTECTED] wrote:
>
> No transactions.
>
Then it won't work. Let's say we take your example. The variable "s" is
supposed to be the sum of a column in a table.
When someone modifies the data in the table, when is "s" adjusted? What i
On Thursday 13 May 2004 10:01 am, shiva chetan wrote:
>
> Where can I find information about the trigger execution model of
> postgresql ? In particular I want to know how triggers are fired when an
> update happens in the database. Is the trigger evaluation and firing part
> of tran
hat you are right and I am wrong, then prove it. I'll
be happy to be shown the error of my thinking (and see an improvement to
PostgreSQL in the process).
That's the great thing about Open Source. We can all talk the talk, but it
comes down to whoever actually walks
Does anyone know where I can obtain it?
Future Thoughts:
OLAP relies on knowing how the data fits together and what kinds of queries
are being done. It could be possible, just by analyzing the queries being
run, to have OLAP automatically kick in without user intervention.
--
Jonathan
On Thursday 18 March 2004 04:30 pm, Tom Lane wrote:
> Jonathan Gardner <[EMAIL PROTECTED]> writes:
> > gcc -O2 -fno-strict-aliasing -Wall -Wmissing-prototypes
> > -Wmissing-declarations -I. -I../../../src/include -D_GNU_SOURCE -c -o
> > bootparse.o bootparse.c
&g
file or directory
make[3]: *** [bootparse.o] Error 1
Am I missing something? I can build all the releases just fine. I've tried
it with several ./configure option, the latest being without
any ./configure options at all, and it still fails.
--
Jonathan Gardner
[EMAIL PROT
On Wednesday 17 March 2004 12:34 am, Dave Page wrote:
> > -Original Message-
> > From: Jonathan Gardner [mailto:[EMAIL PROTECTED]
> > Sent: 17 March 2004 01:41
> > To: [EMAIL PROTECTED]
> > Subject: [HACKERS] Doxygen?
> >
> > I'll start
the head node. We also store the
> length of the list in the struct. As a result, all the above
> operations are now constant time (well, except for equal(), but that
> is now significantly faster in the common case).
>
It looks like the only thing it won't do well is random accesses.
, and perhaps incorporate it into
the source tree?
I'll start posting the documentation I am generating to my vanity site
(announcements later), but would this be something that the postgresql.org
main site would be able to host? It'll be a bunch of static HTML files.
--
lly updating materialized views? I am
currently deleting then reinserting rows that get updated with a pretty
stupid algorithm. If you would like to investigate incremental updates, and
work with me on that, it would probably be interesting and educational.
I think I will be doing most of it
n - which gives
> Relation node for only the System names.
>
> Can anyone please tell me how to get Relation node from relation name ???
>
Won't you have to go get the data from the database for this? I mean
actually execute the query:
select relname from pg_class where oid = 12
in the PostgreSQL documentation.
http://www.postgresql.org/docs/7.4/static/catalogs.html
pg_class is the relation you are looking for.
--
Jonathan Gardner
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 9: the planner will ignore your desire to choose an
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Tuesday 24 February 2004 01:48 pm, Robert Treat wrote:
> On Tue, 2004-02-24 at 12:11, Richard Huxton wrote:
> > On Tuesday 24 February 2004 16:11, Jonathan M. Gardner wrote:
> > > I've written a summary of my findings on implementing and using
> > >
ll, that
distinguishes between users and groups?
- --
Jonathan Gardner
[EMAIL PROTECTED]
Live Free, Use Linux!
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.2.2 (GNU/Linux)
iD8DBQE/4PlpWgwF3QvpWNwRArFHAJ9UQIai+oevgeu8V5JAk+I3gWCUgwCfWUQe
3e8m5CzRZIgzZYUqjnC5ZMg=
=kP5S
-END PGP SIGNATURE---
s something a someone who is new to PostgreSQL development can
attempt? Does someone already have a design planned out?
--
Jonathan Gardner
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 9: the planner will ignore your desire to choose an index scan if your
joining column's datatypes do not match
that the operation is applied to the appropriate partition, using the
function mentioned in Step 2.
Now that view is the partitioned table for all intents and purposes. The
partition tables are the partitions themselves.
Is this what they are looking for, or is it something completely differe
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wednesday 26 November 2003 10:58 am, Jonathan Gardner wrote:
> On Wednesday 26 November 2003 09:19, Hannu Krosing wrote:
> > What is needed is good algorithms. Writing C code is secondary to that.
> >
> > Similar pro
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wednesday 26 November 2003 09:19, Hannu Krosing wrote:
>
> First, You could start by implementing materialized views manually,
> using tables and triggers, to get the feel of what should be generated.
>
> Next, still working from frontend, try to ma
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Thursday 27 November 2003 1:12 am, Peter Eisentraut wrote:
> Jonathan Gardner writes:
> > I know this sounds kind of silly, but I think I would like to be able
> > to send a query to PostgreSQL, and have it parse it into a tree, an
g the front end application of materialized views, I would like to see
if I can deduce what triggers to put where based on the parse tree a query
returns.
Are there any tools to do this? Is this something that exists but is not
documented? Perhaps we can add a "PARSE TREE " command?
ts or updates on the materialized view should be illegal,
except by the triggers. However, perhaps like views work today, we can
allow rules to be added to the table.
Certain restrictions on the materialized views should be enforced: No
mutables, in particular.
- --
Jonathan Gardner
[EMAIL PROTE
he documentation and
see how the indexes and sequences are created and renamed.
- --
Jonathan Gardner
[EMAIL PROTECTED]
Live Free, Use Linux!
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.2.1 (GNU/Linux)
iD8DBQE/UN80WgwF3QvpWNwRAj1yAKDsEHdPNEIIZPMARVfgtvQ43TZeGACgzunp
ssH+tMKhGPby/vBREQJ2Rsw=
get too intimate
with the system tables and the sequences and indexes that are automatically
created, it's their own fault.
- --
Jonathan Gardner
[EMAIL PROTECTED]
Live Free, Use Linux!
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.2.1 (GNU/Linux)
iD8DBQE/UN5CWgwF3QvpWNwRAgr5AKCfEf
s to
determine whether I succeed or not.
Any comments about the project and its scope?
- --
Jonathan Gardner
[EMAIL PROTECTED]
Live Free, Use Linux!
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.2.1 (GNU/Linux)
iD8DBQE/UMOZWgwF3QvpWNwRAtFRAJ9imFuhSzneNCEL5PBmV2EtajCNWACgpKa
seable. However, the
idea is pretty cool. I think it would be nice to have a direct function call
mechanism that bypasses the parser.
Of course, I don't think I understand completely what PQexecParams would do...
:-(
- --
Jonathan Gardner <[EMAIL PROTECTED]>
(was [EMAIL PROTECTED])
L
37 matches
Mail list logo
