Timeline for && vs ST_Intersects performance
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2017 at 19:35 | vote | accept | yurtesen | ||
| Nov 24, 2017 at 16:38 | history | edited | Evan Carroll | CC BY-SA 3.0 |
edited tags
|
| Nov 24, 2017 at 16:33 | history | edited | Evan Carroll |
edited tags
|
|
| Nov 24, 2017 at 16:29 | answer | added | Evan Carroll | timeline score: 11 | |
| Nov 24, 2017 at 16:22 | review | Close votes | |||
| Nov 27, 2017 at 18:03 | |||||
| Nov 24, 2017 at 16:20 | history | edited | Evan Carroll | CC BY-SA 3.0 |
deleted 358 characters in body; edited title
|
| Nov 24, 2017 at 16:15 | history | edited | yurtesen | CC BY-SA 3.0 |
added more info
|
| Nov 24, 2017 at 16:14 | comment | added | yurtesen | The question is if && is significantly faster than ST_Intersects when using with ST_MakeEnvelope (a reactangular boundary), Also am I understanding correctly that when checking points inside a rectangular boundary && does exactly same thing as ST_Intersects? | |
| Nov 24, 2017 at 16:05 | comment | added | Evan Carroll | What is the question? You can publish a self-answered question here, but you have to be asking a question not just researching. | |
| Nov 24, 2017 at 16:02 | history | edited | Evan Carroll | CC BY-SA 3.0 |
edited body
|
| Nov 24, 2017 at 15:59 | history | asked | yurtesen | CC BY-SA 3.0 |