I am interested in the following query:
Given a set of query points ($\leq 10$), how many of them have distance at most $s$ meters to the closest point on the closest street.
What's the most efficient way of writing / pre-processing this query?
1) Pre-process the roads (in osm2pgsql) by replacing each road by a Buffer of $s$ meter width. Then do stabbing queries using
2) Replace each query point by a circle of radius $s$ and query if any road is intersected by a query circle.
3) Other Approaches?