This is not something you will be able to solve without programming skills. You will need to write a little program in a language of your choice that can parse XML documents. Download the area of interest as XML file. You will notice that it consists of three sections - one with all the nodes, one with all the ways, and one with all the relations. Build your program so that it first reads the nodes, storing the latitude and longitude for each node found. Then, when your program arrives at the ways section, let it check whether the way is indeed a road (could also be a building or a power line or something), and when it is, have your program output the way's nodes together with the (previously recorded) node id. A very simple Perl program that does this might look like so: this #!/usr/bin/perl while(<>) { if (/<node id="(\d+)" .*lat="([^"]+)" .*lon="([^"]+)"/) { $loc{$1}="$2,$3"; } elsif(/<tag k="(.*)" v="(.*)"/) { $hwy = $2 if ($1 eq "highway"); $nam = $2 if ($1 eq "name"); } elsif(/<nd ref="(\d+)"/) { push(@nodes,$1); } elsif(/<\/way/) { if (defined($hwy)) { printf "%d,\"%s\",%s\n", $_, $nam, $loc{$_} foreach(@nodes); } undef $hwy, $nam, @nodes; } }} Of course there's many ways in which this can be made more resilient and faster if you need to process large amounts of data.

This is not something you will be able to solve without programming skills. You will need to write a little program in a language of your choice that can parse XML documents. Download the area of interest as XML file. You will notice that it consists of three sections - one with all the nodes, one with all the ways, and one with all the relations. Build your program so that it first reads the nodes, storing the latitude and longitude for each node found. Then, when your program arrives at the ways section, let it check whether the way is indeed a road (could also be a building or a power line or something), and when it is, have your program output the way's nodes together with the (previously recorded) node id. A very simple Perl program that does this might look like so: #!/usr/bin/perl while(<>) { if (/<node id="(\d+)" .*lat="([^"]+)" .*lon="([^"]+)"/) { $loc{$1}="$2,$3"; } elsif(/<tag k="(.*)" v="(.*)"/) { $hwy = $2 if ($1 eq "highway"); $nam = $2 if ($1 eq "name"); } elsif(/<nd ref="(\d+)"/) { push(@nodes,$1); } elsif(/<\/way/) { if (defined($hwy)) { printf "%d,\"%s\",%s\n", $_, $nam, $loc{$_} foreach(@nodes); } undef $hwy, $nam, @nodes; } }

#!/usr/bin/perl while(<>) { if (/<node id="(\d+)" .*lat="([^"]+)" .*lon="([^"]+)"/) { $loc{$1}="$2,$3"; } elsif(/<tag k="(.*)" v="(.*)"/) { $hwy = $2 if ($1 eq "highway"); $nam = $2 if ($1 eq "name"); } elsif(/<nd ref="(\d+)"/) { push(@nodes,$1); } elsif(/<\/way/) { if (defined($hwy)) { printf "%d,\"%s\",%s\n", $_, $nam, $loc{$_} foreach(@nodes); } undef $hwy, $nam, @nodes; } }