If I search for something which is not in db like 'dfsgsdfgsdfgdsfg' it
always work fast. I suspect that speed depends on number of rows retruned,
but I don't know exactly...
--
View this message in context:
http://old.nabble.com/Slow-select-tp26810673p26821859.html
Sent from the PostgreSQL - ge
Sam Mason wrote:
>
> Wouldn't this be "lower(value) = lower(?)" ?
>
Yes, I use it as "lower(value) = lower(?)", I typed inaccurate example.
Sam Mason wrote:
>
> So each query is taking approx 300ms? How much data does each one
> return?
>
No more than 1000 rows.
Sam Mason wrote:
>
> H
I have a table with column of character varying(100). There are about
150.000.000 rows in a table. Index was created as
CREATE INDEX idx_stringv
ON bn_stringvalue
USING btree
(lower(value::text));
I'm trying to execute queries like 'select * from stringvalue where
value=lower(?)'. Making 1
Hello
I have a large database and I'm trying to execute delete on a table which
has some related tables. The query fails with following error:
ERROR: out of memory
DETAIL: Failed on request of size 1048576.
I'm new to postgresql and I'm currently trying to figure out what to do by
myself. I've
