I'm going to write a function in C that parses XML. Is there any way
to index the output of this function? I've got 10,000,000 rows that
contain XML data and I need to efficiently find the ones that contain
the proper keys. I tried pulling the values I want from the data and
putting it in its
Hi everybody,
I have a question, the answer to which may not directly relate to
PostreSQL. Sorry about that.
I am working on the problem of incremental view maintenance and need to
implement the strategies I came up with. I am looking for an existing
implementation of an SQL parser and/or optimize
I can vouch for that. I have several tables with 10
to 16 million entries in much the same sort of setup
as you are describing (primary key, timestamp, value).
PostgreSQL is will quite happily use the timestamp
indexes when accessing this table, and it doesn't
default to a sequential scan until
> > Hmm, does the explain change if you vacuum analyze the other table
> > (prog_data)? If not, what does explain show if you do a
> > set enable_seqscan='off';
> > before it?
Did you do the vacuum analyze on the other table (prog_data) as well?
It seems to be overestimating the number of joined
On Tue, 16 Oct 2001, Anthony Bouvier wrote:
> I can create an AGGREGATE but from what I can tell, the format of the
> sfunc can only have two parameters like so:
>
> sfunc_name(type,type)
>
> Where the first parameter is what was passed before, and the second
> parameter is the 'new' info to do s
On Tue, 16 Oct 2001, Steven Dahlin wrote:
> I am trying to find the equivalent in Postgresql to the Oracle sql function
> nvl(). With nvl() you give two parameters. The first may be a field/column
> or variable. If the value is not null then it is returned by the function.
> For example the wi
Tom,
> Kinda hard to believe; even if the old indexes were still around,
> they
> wouldn't be considered to apply to the new table. I think the
> problem
> is something else. Can you provide a reproducible example of what
> you're seeing?
Wish I could; it only seems to happen on the production
First of all, thanks to Philip Hallstrom for the quick reply.
Consider the following tables
CREATE TABLE advncd_onfvalue
(timepoint DATETIMENOT NULL,
midINTEGER NOT NULL,/* measurement id */
lidINTEG
Tom,
> I don't believe a single word of that explanation ... whatever is
> going
> on here, that ain't it. A new table is going to have a new OID, and
> so will its indexes; there is no way that Postgres will confuse it
> with
> the old one, even if bits of the old one were still hanging around
Aasmund,
> I do not know whether it is part of the SQL standard.
>
> Variables...
Nope.
> CREATE VARIABLE foobar INTEGER DEFAULT 1 NOT NULL;
>
> SELECT * FROM thebar WHERE id = foobar;
>
> CREATE TEMPORARY VARIABLE...
> CREATE CONSTANT
Extensive support for a variety of variable types
"Josh Berkus" <[EMAIL PROTECTED]> writes:
> This is on 7.1.2 (SuSE 7.2, ReiserFS, PG built from source). Explicitly
> dropping the indexes before dropping the tables seems to have solved the
> problem. My guess, without understanding the guts of the thing at all,
> is that the transactional natu
Hello Tom!
Thank you for your help!
Your hints did solve the asked problem.
The update trigger is fired if there is a row in the table test to be
updated.
But, behind my question there was another design (philosophie) which I
am trying to
solve by the means of different triggers.
This is off
Reiner Dassing <[EMAIL PROTECTED]> writes:
> I have a table which has a lot of entries (some x millions) of the kind
> (id, timestamp, value)
> The access (selects) is concentrated to the timely last some thousands
> entries.
> To adapt this fact I want to setup a "virtual" table - test in my
> e
On Tue, 16 Oct 2001 17:58:32 +0100
Stuart Grimshaw wrote:
> On Monday 15 October 2001 16:12 pm, Tom Lane wrote:
> > Stuart Grimshaw <[EMAIL PROTECTED]> writes:
> > > SELECT a.category, b.headline, b.added, c.friendlyname
> > > FROM caturljoin as a
> > > INNER JOIN stories as b ON (a.url =
"Josh Berkus" <[EMAIL PROTECTED]> writes:
> 1. INDEXES: I discovered, the hard way, a peculiar problem. If you drop
> and re-create a table within the same transaction (in a function, for
> example) the indexes do not get dropped completely.
Kinda hard to believe; even if the old indexes were st
I have a sub in a Perl script that loops execution the following
statement:
SELECT url,name FROM links
And formats it like so:
$name
A variable ($link_list) is in the loop, holding the concatenated last
statement with the new one.
I would rather do this with FUNCTIONS (and/or AGGREGATES).
I am trying to find the equivalent in Postgresql to the Oracle sql function
nvl(). With nvl() you give two parameters. The first may be a field/column
or variable. If the value is not null then it is returned by the function.
For example the with query below if the :ClientParameter is passed th
Who is this?
- Original Message -
From: Josh Berkus <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Wednesday, October 17, 2001 8:59 AM
Subject: [SQL] Performance problems - Indexes and VACUUM
> Tom, Folks:
>
> I am having a rather interesting time getting performance out of my
> datab
Stephan Szabo and Josh Berkus,
Thanks for your input. The question at hand seemed to provide an appealing
argument for providing inheritance support for referencial constraints, but
if its support is as rare as it seems to be then that could produce problems
if I want the ability to b
Hi,
I did not make vacuum analyze ;), the vacuum once now:
vacuumdb -Uuser -ddb -v -tprog_dgy_xy
NOTICE: --Relation prog_dgy_xy--
NOTICE: Pages 20935: Changed 0, reaped 0, Empty 0, New 0; Tup 921013:
Vac 0, Keep/VTL 0/0, Crash 0, UnUsed 0, MinLen 178, MaxLen 184;
Re-using: Free/Avail. Spac
I forget:
select version();
version
-
PostgreSQL 7.1.3 on i386-unknown-freebsd4.3, compiled by GCC 2.95.3
It seems that there are index using problems in 7.1.3 ?
(checkin same problem in comp.dat
21 matches
Mail list logo
