Thanks a lot for these details Tom, I will checkout the scan.l file
Best regards,
Sayali
Tom Lane <[EMAIL PROTECTED]> wrote:
sayali k writes:
> I am having a project in Postgres where I need to modify some code in the
> parser section of the code base. During some analysis I came across a
I am trying to implement materialized views using trigger which will be used to
maintain the views which will be generated. For this I am required to add a new
command for the creation of a materialized view, which is already done by
modifying the grammar in the gram.y file.
However, I need to
On Oct 27, 2007, at 1:36 AM, Magnus Hagander wrote:
If this isn't fixed then PG will never be a supported infrastructure
service at JPL the way MySQL currently is. I had hoped to use the
GSSAPI support as a feature to pry some people away from MySQL, but
without the ability to integrate into a
On Oct 27, 2007, at 2:20 PM, Florian Weimer wrote:
* J. Andrew Rogers:
Everything you are looking for is here:
http://web.mit.edu/dna/www/vldb07hstore.pdf
It is the latest Stonebraker et al on massively distributed in-memory
OLTP architectures.
"Ruby-on-Rails compiles into standard JDBC, b
Hi Simon,
Sorry I forgot to mention your name in the commit message :-( This
weekend I'm moving to a new flat so I was distracted. Thanks for the
patch, I didn't change it much.
This is also the only excuse I have for being unavailable to commit other
fixes; I apologize for neglecting letting
Hello
three years ago was big discus about stored procedures. Three years
later postgresql does not support stored procedures. So instead of one
super big jump I would to do more small steps.
2007/10/27, Hannu Krosing <[EMAIL PROTECTED]>:
> Ühel kenal päeval, L, 2007-10-27 kell 13:43, kirjutas Gr
Ühel kenal päeval, R, 2007-10-26 kell 16:46, kirjutas Gokulakannan
Somasundaram:
> What does the numbers look like if the the tables are small
> enough to
> fit in RAM?
>
> I don't know whether this is a valid production setup, against which
> we need to benchmark.
Often
* J. Andrew Rogers:
> Everything you are looking for is here:
>
> http://web.mit.edu/dna/www/vldb07hstore.pdf
>
> It is the latest Stonebraker et al on massively distributed in-memory
> OLTP architectures.
"Ruby-on-Rails compiles into standard JDBC, but hides all the complexity
of that interface.
On Sun, Oct 28, 2007 at 12:05:26AM +0300, Hannu Krosing wrote:
> Ühel kenal päeval, L, 2007-10-27 kell 12:55, kirjutas Josh Berkus:
> > Merlin, Pavel,
> >
> > > Mutable session variables would be nice, but I'll take a plpgsql
> > > langauge (or psm) with or without them, so long as transactions
>
Ühel kenal päeval, L, 2007-10-27 kell 12:55, kirjutas Josh Berkus:
> Merlin, Pavel,
>
> > Mutable session variables would be nice, but I'll take a plpgsql
> > langauge (or psm) with or without them, so long as transactions are
> > manual. It's possible to emulate variables using scalar functions
Ühel kenal päeval, L, 2007-10-27 kell 13:43, kirjutas Gregory Stark:
> "Pavel Stehule" <[EMAIL PROTECTED]> writes:
>
> > Later:
> > * procedure can manages transactions,
>
> Personally this is the only actual feature on the list that seems to have any
> point to me.
Same here.
And I'd like it t
Merlin, Pavel,
> Mutable session variables would be nice, but I'll take a plpgsql
> langauge (or psm) with or without them, so long as transactions are
> manual. It's possible to emulate variables using scalar functions
> with the desired volatility currently (but you still have to be
> careful w
On Sat, Oct 27, 2007 at 11:04:19AM -0400, Tom Lane wrote:
> Well, that's surely a good idea, but there'll have to be some
> negotiation to figure out how to do that. None of those files are
> currently designed with any thought of being compilable outside the
> backend environment.
>
> The hard p
2007/10/27, Camilo Porto <[EMAIL PROTECTED]>:
> The parallelism happens even if my PC has only one processor?
PostgreSQL creates a separate process for each client connection -
whether you have one CPU or more.
> Each query is executed in a separeted Thread?
No threads, at least on Unix. Regular
Sebastien FLAESCH wrote:
Forget this one, just missing the WITH HOLD option... Must teach myself a bit
more before sending further mails. Seb
AFAIK you cannot use "WITH HOLD" together with updateable cursors.
I might be wrong, though...
regards, Florian Pflug
---(end o
Peter Eisentraut wrote:
Am Donnerstag, 25. Oktober 2007 schrieb Andrew Dunstan:
From time to time people have raised the idea of a CPAN-like mechanism for
downloading, building and installing extensions and the like (types,
functions, sample dbs, anything not requiring Postgres itself to be
re
Hi,
I don't know whether this input would be useful. But what i could observe
from the behavior of MIN/MAX is
It goes to the proper page, but starts the page scan in a opposite way. Say
for example you want the min value, it goes to the first leaf page, but
starts from the last tuple and comes
Michael Meskes <[EMAIL PROTECTED]> writes:
> On Thu, Oct 25, 2007 at 11:31:15AM -0400, Tom Lane wrote:
>> ecpg cannot do that. It would fail if parser.c happened to use anything
>> that won't compile in frontend, eg elog() or palloc(). It's mere luck
>> that it's worked for him so far.
> No, act
"Tom Lane" <[EMAIL PROTECTED]> writes:
> The only case where the optimization is a win is where you have a
> zero-startup-cost subplan, and the only way to get sorted output with zero
> startup cost is an indexscan.
Sure but there could be other nodes above the index scan which preserve the
order
2007/10/27, Tom Lane <[EMAIL PROTECTED]>:
> "Pavel Stehule" <[EMAIL PROTECTED]> writes:
> > 2007/10/27, Tom Lane <[EMAIL PROTECTED]>:
> >> Most of that sounded to me like a proposal to re-invent ecpg. If there
> >> were such a large demand for doing things that way, there would be many
> >> more u
On 10/27/07, Gregory Stark <[EMAIL PROTECTED]> wrote:
> > Most of that sounded to me like a proposal to re-invent ecpg. If there
> > were such a large demand for doing things that way, there would be many
> > more users of ecpg than bare libpq. AFAICT, though, *very* few people
> > use ecpg.
>
>
On Thu, Oct 25, 2007 at 11:31:15AM -0400, Tom Lane wrote:
> > The problem is that ecpg shares parser.c source code and this code
> > includes postgres.h.
>
> ecpg cannot do that. It would fail if parser.c happened to use anything
> that won't compile in frontend, eg elog() or palloc(). It's mer
On Mon, Oct 22, 2007 at 10:07:03AM -0400, Boergesson, Cheryl wrote:
> The program below works with PostgreSQL 8.0.3, but not 8.1.10. The
> error I receive is:
> ...
Is there a way for you to compile and run the program without threading?
Or try with CVS head instead of 8.1.10?
Michael
--
Michae
"Pavel Stehule" <[EMAIL PROTECTED]> writes:
> 2007/10/27, Tom Lane <[EMAIL PROTECTED]>:
>> Most of that sounded to me like a proposal to re-invent ecpg. If there
>> were such a large demand for doing things that way, there would be many
>> more users of ecpg than bare libpq. AFAICT, though, *very
[Camilo Porto]
> To: [EMAIL PROTECTED]
> CC: pgsql-hackers@postgresql.org
> Subject: Re: [HACKERS] URGENT HELP about 'duration' stats
> Date: Fri, 26 Oct 2007 23:06:22 -0400
> From: [EMAIL PROTECTED]
>
> Camilo Porto <[EMAIL PROTECTED]> writes:
> > The problem I have encountered is that the su
2007/10/27, Tom Lane <[EMAIL PROTECTED]>:
> Gregory Stark <[EMAIL PROTECTED]> writes:
> > "Pavel Stehule" <[EMAIL PROTECTED]> writes:
> >> Why new calling convention? I would to support byref variables and
> >> then I have to carry memory context info ... and maybe some others
>
> > I think first y
"Tom Lane" <[EMAIL PROTECTED]> writes:
> Gregory Stark <[EMAIL PROTECTED]> writes:
>> "Pavel Stehule" <[EMAIL PROTECTED]> writes:
>>> Why new calling convention? I would to support byref variables and
>>> then I have to carry memory context info ... and maybe some others
>
>> I think first you hav
Gregory Stark <[EMAIL PROTECTED]> writes:
> This requires treating columns of subrels as equivalent to the columns of the
> parent. Offhand I think that's theoretically ok since they'll never be
> available except where they are in fact equivalent, but I'm not too familiar
> with equivalence classe
Gregory Stark <[EMAIL PROTECTED]> writes:
> I don't understand why it wouldn't work to do it for any arbitrary path for
> any query at all as long as it has the correct ordering.
It might work, but the resulting plan would be uniformly inferior to the
regular aggregate code. The only case where t
Gregory Stark <[EMAIL PROTECTED]> writes:
> "Pavel Stehule" <[EMAIL PROTECTED]> writes:
>> Why new calling convention? I would to support byref variables and
>> then I have to carry memory context info ... and maybe some others
> I think first you have to invent something for the by-ref parameter
sayali k <[EMAIL PROTECTED]> writes:
> I am having a project in Postgres where I need to modify some code in the
> parser section of the code base. During some analysis I came across a
> function called "base_yylex" which is called in the function yylex in the
> file parser.c. However, I was u
Gregory Stark <[EMAIL PROTECTED]> writes:
> "Tom Lane" <[EMAIL PROTECTED]> writes:
>> The idea I'm toying with is to make pathkeys_useful_for_merging()
>> consider only ASC pathkeys as useful for merging --- that is, only
>> pathkeys with pk_strategy = BTLessStrategyNumber.
> So the case that woul
In investigating the planner changes necessary for the append node planning I
described in my other email I noticed something else I find strange.
The min/max optimization which builds an "ORDER BY ... LIMIT 1" type of plan
for min or max works by explicitly building an index path to scan a plain
"Pavel Stehule" <[EMAIL PROTECTED]> writes:
> Later:
> * procedure can manages transactions,
Personally this is the only actual feature on the list that seems to have any
point to me.
> Why new calling convention? I would to support byref variables and
> then I have to carry memory context info
Hello,
I found lot of discus about this topic.
http://www.postgresql.org/docs/faqs.TODO.html
http://archives.postgresql.org/pgsql-hackers/2003-08/msg00501.php
http://archives.postgresql.org/pgsql-hackers/2004-09/msg00734.php
http://archives.postgresql.org/pgsql-hackers/2004-08/msg00872.php
http:/
Hi all,
I am having a project in Postgres where I need to modify some code in the
parser section of the code base. During some analysis I came across a function
called "base_yylex" which is called in the function yylex in the file parser.c.
However, I was unable to find the definition of this
Henry B. Hotz wrote:
> What the krb5 method does is IMO a documented bug. The realm name
> is part of the name.
>
> As I explained at some length you cannot assume the username (first
> component of the principal) has any meaning by itself, except in
> small deployments wit
The topic was recently mentioned again on -performance of Append nodes from
inherited tables destroying available orderings. Luke posted a patch a while
back which enabled using indexes for the sub plans and preserved the orderings
though a lot of the meat of the code to do this was missing from t
"Tom Lane" <[EMAIL PROTECTED]> writes:
> The idea I'm toying with is to make pathkeys_useful_for_merging()
> consider only ASC pathkeys as useful for merging --- that is, only
> pathkeys with pk_strategy = BTLessStrategyNumber. This would mean that
> only forward scans on ASC indexes and backward
39 matches
Mail list logo
