Andrew Dunstan wrote:
Vinay Jain said:
Andrew Dunstan wrote:
If course it is not loaded each time. That would be insane. If not
preloaded it is loaded when first called in each process, and then
kept. It is never unloaded (except by the termination of the process
that loaded it).
It seems
Vinay Jain said:
> Andrew Dunstan wrote:
>
>>
>>If course it is not loaded each time. That would be insane. If not
>>preloaded it is loaded when first called in each process, and then
>>kept. It is never unloaded (except by the termination of the process
>>that loaded it).
>>
>>It seems you have be
Andrew Dunstan wrote:
Vinay Jain said:
Andrew Dunstan wrote:
uh ... maybe you need to look in your C manual about the effect of a
"static" declaration. The object will be created once.
yup I know the effect of Static but this is also fact that when
program terminates and restarts o
Vinay Jain said:
> Andrew Dunstan wrote:
>
>>
>> uh ... maybe you need to look in your C manual about the effect of a
>> "static" declaration. The object will be created once.
>>
> yup I know the effect of Static but this is also fact that when
> program terminates and restarts object will be creat
Andrew Dunstan wrote:
Vinay Jain wrote:
You mean that I should create a static table in C program itself and
use it...if i am not wrong
Ya for the time being i am doing this thing but actually table is
bigger (around 5000 rows with 6 columns)
bigger than what?
also this table is also created
Tom Lane wrote:
Vinay Jain <[EMAIL PROTECTED]> writes:
Not actually even in Hindi Locale the output was incorrect..i.e. sort
order was wrong
and also length and substring operations
which are not based on syllables.
Hm, possibly you weren't using the same character set encoding that the
l
Vinay Jain <[EMAIL PROTECTED]> writes:
> Not actually even in Hindi Locale the output was incorrect..i.e. sort
> order was wrong
> and also length and substring operations
> which are not based on syllables.
Hm, possibly you weren't using the same character set encoding that the
locale was expect
Vinay Jain wrote:
You mean that I should create a static table in C program itself and
use it...if i am not wrong
Ya for the time being i am doing this thing but actually table is
bigger (around 5000 rows with 6 columns)
bigger than what?
also this table is also created and destroyed in each ind
Andrew Dunstan wrote:
Vinay Jain said:
hi
ya function is declared immutable and strict... also made btree
index..
The docs state this about immutable functions:
IMMUTABLE indicates that the function always returns the same result when
given the same argument values; that is, it does not d
Tom Lane wrote:
Vinay Jain <[EMAIL PROTECTED]> writes:
Which takes a lot of time the reason is that in every indchar_lt
function call SPI connection is made and destroyed...
I cannot imagine how you'd think that that would be practical from a
performance standpoint.
Here is the problem
Vinay Jain said:
> hi
> ya function is declared immutable and strict... also made btree
> index..
The docs state this about immutable functions:
IMMUTABLE indicates that the function always returns the same result when
given the same argument values; that is, it does not do database lookups
or
Vinay Jain <[EMAIL PROTECTED]> writes:
> Which takes a lot of time the reason is that in every indchar_lt
> function call SPI connection is made and destroyed...
I cannot imagine how you'd think that that would be practical from a
performance standpoint.
> Here is the problem which i found in po
hi
ya function is declared immutable and strict... also made btree index..
one mistake that i was doing that I was using libpq rather than
SPI..but even after using it though no doubt the performance is
increased still not up to the mark
if i use index than it's explain analyze is like this :
Vinay Jain wrote:
Hi
thanx and sorry that I asked such a simple question in postgres-hackers
list
but the complexity which i feel on that basis please allow me to
explain my problem further.
As i am working on sorting order , length and substring functions for
Hindi text(Indian Langu
Hi
thanx and sorry that I asked such a simple question in postgres-hackers
list
but the complexity which i feel on that basis please allow me to
explain my problem further.
As i am working on sorting order , length and substring functions for
Hindi text(Indian Language)...
Here is th
Vinay Jain wrote:
Hi
thank you for such a useful information...
but actually in my case if i keep table in disk it significantly
degrades performance and even for a table of 10 rows it takes 1-2
minutes I think u r not beliving it ! am i right
for example
I create a table in which i use m
Hi
thank you for such a useful information...
but actually in my case if i keep table in disk it significantly
degrades performance and even for a table of 10 rows it takes 1-2
minutes I think u r not beliving it ! am i right
for example
I create a table in which i use my customized data
On Wed, 21 Apr 2004 [EMAIL PROTECTED] wrote:
> Hi
> I am working on a project in postgres..in which i designed customized data type
> and operations on it.it requires a look up table..
> I have three options regarding this table...
> 1. Every time a query is executed it creates table assigns value
Hi
I am working on a project in postgres..in which i designed customized data type
and operations on it.it requires a look up table..
I have three options regarding this table...
1. Every time a query is executed it creates table assigns values and after
execution destroys it...which is overhead..
19 matches
Mail list logo