Timeline for Spatial joining two line layers and checking intersection in PostgreSQL/PostGIS
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 19, 2020 at 8:24 | history | edited | geozelot |
edited tags
|
|
| Apr 16, 2019 at 3:18 | vote | accept | poonam patel | ||
| Apr 15, 2019 at 9:17 | comment | added | geozelot | my suggestion is my answer. I'm just trying to explain why your query will fail with useless results after a lifetime of execution...,) | |
| Apr 15, 2019 at 9:13 | comment | added | poonam patel | Ya understand but i dont find any other way to filter out non intersected lines.i am trying your queries now .Do you have any suggestions? | |
| Apr 15, 2019 at 9:11 | history | became hot network question | |||
| Apr 15, 2019 at 9:01 | comment | added | geozelot | ...or better, when table A has 3 rows and B 100, with no intersection, your query will return 300 rows. similar, with 1000 in A and 1000 in B, Postgres fetches 1000000 rows after computing each of them... | |
| Apr 15, 2019 at 8:54 | answer | added | geozelot | timeline score: 7 | |
| Apr 15, 2019 at 8:33 | comment | added | geozelot | non-intersections are tricky; your query will result in a carestian product of both tables, that's why it is so slow. your join condition matches every pair of lines that do not intersect; so if table A has 1 row and table B 100, with no intersection between them, you will get 100 rows returned! | |
| Apr 15, 2019 at 5:33 | history | edited | Taras♦ | CC BY-SA 4.0 |
Structured, Title adjusted
|
| Apr 15, 2019 at 5:22 | answer | added | blabbath | timeline score: 0 | |
| Apr 15, 2019 at 3:49 | history | asked | poonam patel | CC BY-SA 4.0 |