Hacker News new | ask | show | jobs
by chipsambos 3698 days ago
I work on a SaaS spatial product and had to come up with a solution to the same point/boundary problem. It needed to be 'fast' (ideally <3s) when filtering, rendering, styling and summarising 100k points within 43k polygons (so say 100k shop locations within many state, county and zip/zcta codes in US). DB is Oracle 11g for several reasons: product is larger and older than this requirement, small team has solely expertise with oracle and zero commercial experience with nosql dbs (good devs though and have showed interest in and toyed with nosql dbs) plus standard budget/time constraints.

Solution was to add a hidden column for each administrative category (e.g. for US: region, state, county, zcta) to each point record to replace spatial searches with filtering.

Would something like that work for you? What kind of numbers of points and polygons are you looking at and how quickly do you need to solve the problem?