Timeline for Do large vertex counts cause performance issues?
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 31, 2012 at 20:22 | history | edited | underdark | CC BY-SA 3.0 |
edited title
|
May 31, 2012 at 20:04 | answer | added | Jmoney38 | timeline score: 5 | |
May 31, 2012 at 19:59 | vote | accept | Jmoney38 | ||
May 31, 2012 at 19:50 | answer | added | Nicklas Avén | timeline score: 4 | |
May 31, 2012 at 17:14 | history | tweeted | twitter.com/#!/StackGIS/status/208245198290034688 | ||
May 31, 2012 at 16:27 | comment | added | Jmoney38 | Interesting point - thanks. So here's a more direct question that I hinted at in the O.P. - How does PostGIS/Postgres store the geometry types? TOAST tables are used for variable length data, so I would THINK they're also used for geometry types. Higher vertex counts could mean more TOAST table look ups. | |
May 31, 2012 at 16:01 | comment | added | whuber | Basic geometry operations, such as intersection, point-in-polygon, etc., typically scale logarithmically with geometry size, provided precomputation (such as contained in "index" files in certain GISes) occurs. If this is the case in PostGIS, then modest reductions in vertex count--even removing 90% of them--ought to have little real effect on CPU cycles. Data throughput for a few thousand records shouldn't be an issue, either. Obviously this is just speculation, but it suggests some simple scaling tests would resolve the question. | |
May 31, 2012 at 15:26 | history | asked | Jmoney38 | CC BY-SA 3.0 |