If I have a relation and create a multicolumn index on all the
attributes,
would the index be bigger than the relation itself?
would it be more efficient to keep the relation ordered on all the
attribute if I have
a lot of additions?
I have relations that are only incremental in time and they are h
Hi,
I need to verify something.
I use spi cursors in a C function (which return a SETOF).
I am using the spi cursors to run the following query:
"SELECT DISTINCT * FROM mytable".
Each time the system gets back to the function
spi cursor can give me the next tuple which I can return.
Q1:My question
to the mailing list cleanly
>
> ---(end of broadcast)---
> TIP 2: Don't 'kill -9' the postmaster
--
Regards,
Tzahi.
--
Tzahi Fadida
Blog: http://tzahi.blogsite.org | Home Site: http://tzahi.webhop.info
WARNING TO SPAMMERS: see at
http://members.lycos.co.uk/my2nis/spamwarning.html
---(end of broadcast)---
TIP 2: Don't 'kill -9' the postmaster
Hi all,
I am doing experiments on a new operator I am writing as a C shared
library function.
1) As part of the experimentation I need to know exactly how many blocks
have been read/write when
the algorithm ran. I need complete control over the process to run my
simulations.
I see that there are
Hi, I am learning how to use the c functions and my function below works
when I do:
select testgetrows();
but when I do select * from testgetrows(); I am getting:
"ERROR: cache lookup failed for type 0"
Whats's the problem?
10x.
drop function testgetrows();
CREATE OR REPLACE FUNCTION testgetrows
ption. the rows are
returned ok with select testgetrows();
but not with select * from testgetrows();
Regards,
tzahi.
> -Original Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Tom Lane
> Sent: Friday, January 07, 2005 8:59 PM
> To: Tzah
tx->lRel, AccessShareLock);
SRF_RETURN_DONE(funcctx);
}
}
Regards,
tzahi.
> -----Original Message-
> From: Tom Lane [mailto:[EMAIL PROTECTED]
> Sent: Friday, January 07, 2005 10:31 PM
> To: Tzahi Fadida
> Cc: pgsql-general@postgresql.org
> Subject:
005 12:24 AM
> To: Tzahi Fadida
> Cc: pgsql-general@postgresql.org
> Subject: Re: [GENERAL] ERROR: cache lookup failed for type 0
>
>
> Tzahi Fadida <[EMAIL PROTECTED]> writes:
> > well, I tried the heap_deformtuple and I am getting now: select
> > testgetrows(
I have been trying for a week now without success to discover
if you can measure the cost of a query (with my c function).
EXPLAIN ANALYZE seems to give you the actual time it took it
to run but the "cost" seems to be a fixed estimate number and not
actual. I see in the code many times references t
ent: Sunday, January 16, 2005 5:44 AM
> To: Tzahi Fadida
> Cc: pgsql-general@postgresql.org
> Subject: Re: [GENERAL] Is it possible to measure IO costs of
> a query in postgreSQL?
>
>
> On Sat, Jan 08, 2005 at 08:01:51PM +0200, Tzahi Fadida wrote:
>
> > I have been tryi
I had this problem too, I am not sure why it happens.
I am just guessing but I think its because of XP sp2.
If you want to use the latest ms installer, at least at this point,
you must install sp2.
Anyway, what I did is something very funny. I opened the pg installer
many times and then opened the
I recommend you don't use ext3 for any database:
http://seclists.org/lists/linux-kernel/2005/Jan/0641.html
apparently its still buggy.
Regards,
tzahi.
> -Original Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Mage
> Sent: Monday, January 17, 2005 9:
Hi,
I am writing an algorithm in a dynamic c library and using heap_fetch.
I want to pin strategic buffers for long times like an Outer
joins might do for the inner table.
Do i to also need to lock the table somehow?
I am only reading the tuple but maybe other transactions will
want to write to
> -Original Message-
> [mailto:[EMAIL PROTECTED] On Behalf Of Tom Lane
>
> Tzahi Fadida <[EMAIL PROTECTED]> writes:
> > I am writing an algorithm in a dynamic c library and using
> heap_fetch.
> > I want to pin strategic buffers for long times like an
I am just a newbie but logically:
Maybe the answer to that is much simpler.
Ask your network officer to tell you whats the bandwidth you
have on your current office and remote office.
whats the avg:
a. website bandwidth.
b. current postgress office bandwidth.
I never used replication but it seem
I am not an expert to postgres internals but in General:
if you have a btree multicolumn index on the 4 fields
then it should take around logF(4M). lets guess the F
to be 5 so its around 10 ios +1 block read.
for the same thing for a hashtable its about the same or less.
if you have any subset o
Hi,
I am trying to determine if there is a difference in
I/O cost between SPI functions and low level functions
like heap_fetch, heap_getnext, etc...
I want to decide if there is any merit for using the low
level functions instead of the easier SPI.
My guess is that they both use the same underlyin
Its called a "temporal database".
Usually its intended for medical or police databases where
you need a hind sight. i.e. if today is 31/12/2005, what did we know at
20/12/2005.
for example, for a doctor appearing at court and required to testify
what he knew at 20/12/2005.
Very cool.
It would be
C):
XYZ
Null | b |c
a| Null |d
a| b | Null
As can be clearly seen, we get incomplete information.
Regards,
Tzahi.
--
Tzahi Fadida
http://tzahi.blogsite.org | http://tzahi.webhop.info
WARNING TO SPAMMERS: see at http
ECTED] On Behalf Of Tom Lane
> Sent: Saturday, May 06, 2006 12:26 AM
> To: Tzahi Fadida
> Cc: pgsql-general@postgresql.org
> Subject: Re: [GENERAL] Google Summer of Code: Full Disjunctions
>
> "Tzahi Fadida" <[EMAIL PROTECTED]> writes:
> > The output of
Hi Lee,
First, i have no knowledge of anyone that have implemented full
disjunctions(ever) aside
from the theoretical works of my colleagues.
With the exception of a corner case of it, that I believe was a simulation in
96.
(A. Rajaman and J.D. Ullman Integrating information by outerjoins and
f
> -Original Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of
> [EMAIL PROTECTED]
> Sent: Tuesday, May 09, 2006 1:51 AM
> To: pgsql-general@postgresql.org
> Subject: Re: [GENERAL] Google Summer of Code: Full Disjunctions
>
> > First, i have no knowledge of anyo
22 matches
Mail list logo
