hi all
In my query I have two tables (edges 3,600,000 tuples and nodes 1,373,00
tuples), where I want to obtain all edges,whose target vertex is within a given
euclidean range starting from a query point q:
the query is formulated as following:
SELECT
E.ID,
E.SOURCE,E.SOURCE_MODE,E.TARGET,E
Hi Tom,
thanks for your suggestion:
> Markus Innerebner writes:
>> The query plan says, that a sequential scan is performed on the edge table.
>> I consider it strange that he is not accessing on the (btree) index one the
>> edge table.
>
> This suggests that y
shared_buffers = 650MB
work_mem = 512MB
maintenance_work_mem = 256MB
effective_cache_size = 500MB
--
Ph D. Student Markus Innerebner
DIS Research Group - Faculty of Computer Science
Free University Bozen-Bolzano
Dominikanerplatz 3 - Room 211
I - 39100 Bozen
Phone: +39-0471-016143
Mobile: +39-333
Hi Laurenz,
>
> In your approach 1 to 3, what do you mean with "load into main memory"?
I forgot to say: I use Java and connect with JDBC.
in approach 1 I do an initial loading of the entire relation, by executing 1
SQL query to load all edges in main memory, where I create my main memory
st
thanks a lot for your feedback.
It helped me a lot and I have now a better overview in very specific hints,
which I wasn't able to find in any documentation.
Cheers Markus
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http
Hello
please do not consider this email as an yet another question how to speed up
writing.
The situation is different:
My algorithm stores after the computation the result as tuples in a DB.
The tuples in addition to normal values (e.g. a,b) , contains sql statements
that fetch values (for in