Overpass query optimisation

Question

I am trying to write a query that will return all pubs and bars around a certain point. I'm having issues with the results that are ways. At the moment I am getting all the nodes for the way and then using some post processing to match up the first node of the way to the node lat/long data. Obviously, this is largely inefficient. This is the query I'm currently using. Many thanks.

[out:json]; (node[amenity=pub](around:5000,51.5152117,-0.144044); foreach(out;) way[amenity=pub](around:5000,51.5152117,-0.144044); foreach( out; node(w); out; ); node[amenity=bar](around:5000,51.5152117,-0.144044); foreach(out;) way[amenity=bar](around:5000,51.5152117,-0.144044); foreach( out; node(w); out;);); (._;%3E;)

Accepted Answer

Each way lists it's member nodes, so in your post processing you can build a mapping of node ids to nodes and use that to retrieve a way node, you don't need to order the output. So a query like http://overpass-turbo.eu/s/Cne should work.

[out:json];
(node[amenity=pub](around:5000,51.5152117,-0.144044);
way[amenity=pub](around:5000,51.5152117,-0.144044);
node[amenity=bar](around:5000,51.5152117,-0.144044);
way[amenity=bar](around:5000,51.5152117,-0.144044);
);
(._;>;);
out;

You might also be interested in out center; which converts ways to a node at the center of the bounding box of the way (or relation).

Overpass query optimisation

Follow this question

Related questions