From: | giuseppe(dot)derossi(at)email(dot)it |
---|---|
To: | pgsql-admin(at)postgresql(dot)org |
Subject: | geometry poligons performance and index |
Date: | 2007-08-27 09:29:21 |
Message-ID: | 73404859e1621951075c1c474115a096@164.129.1.43 |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-admin |
Hi
I need to set a query which performs a intersection check between two set of
polygons which are stored into two tables.
I wrote the where instruction so:
...
where area(intersection(t1.the_geom,t2.the_geom))>0
...
The results are ok, but the query is too slow. I tried to applay a GIST and
gtree index but performance did not improve.
By explaining the query I see that the where condition gets the query slow.
Is there a more simple way to check if two poligons have a not null
intersection (they overlap)?
Is there a kind of index I can use ?
THanks
Giu
--
Email.it, the professional e-mail, gratis per te: http://www.email.it/f
Sponsor:
Hai bisogno di contanti per realizzare i tuoi desideri? Prometeo ti propone
prestiti da 1.500 a 31.000 Euro! Clicca qui per un preventivo immediato.
Clicca qui: http://adv.email.it/cgi-bin/foclick.cgi?mid=6916&d=20070827
From | Date | Subject | |
---|---|---|---|
Next Message | giuseppe.derossi | 2007-08-27 10:10:02 | pop-up multiselection array and where condition |
Previous Message | Johann Spies | 2007-08-27 09:14:03 | Re: PostgreSQL and virtualization |