postgis-workshop/knn — Spanish @ OSGeo Weblate: A frequently posed spatial query is: "what is the nearest …

Translation

English

Spanish

Needs editing

Skip

	English	Spanish	Actions
	Nearest-Neighbour Searching	Vecinos cercanos
	What is a Nearest Neighbour Search?	¿Qué es el Buscador de Vecinos Cercanos?
	A frequently posed spatial query is: "what is the nearest <candidate feature> to <query feature>?"	Una pregunta espacial frecuente es ¿Cuál es la entidad más cercana a la consulta de entidad realizada?.
	Unlike a distance search, the "nearest neighbour" search doesn't include any measurement restricting how far away candidate geometries might be, features of any distance away will be accepted, as long as they are the nearest.
	PostgreSQL solves the nearest neighbor problem by introducing an "order by distance" (``<->``) operator that induces the database to use an index to speed up a sorted return set. With an "order by distance" operator in place, a nearest neighbor query can return the "N nearest features" just by adding an ordering and limiting the result set to N entries.
	The "order by distance" operator works for both geometry and geography types. The only difference between how they work between the two types is the distance value returned. For geometry ``<->`` returns the same answer as `ST_Distance` which is dependent on the units of the spatial reference system in use. For geography the distance value returned is the sphere distance, instead of the more accurate spheroidal distance that ``ST_Distance(geography,geography)`` returns.
	Here's the 3 nearest streets to 'Broad St' subway station:
	How can we be sure we are getting an index-assisted query? It's a good idea to check the ``EXPLAIN`` output for a nearest-neighbor query, because it's possible to get correct answers from non-indexed SQL and the lack of an index might not be obvious until the size of the tables scales up.
	This is the output from ``EXPLAIN``, note the index scan over the order by:
	Nearest Neighbor Join
	The index assisted order by operator has one major draw back: it only works with a single geometry literal on one side of the operator. This is fine for finding the objects nearest to one query object, but does not help for a spatial join, where the goal is to find the nearest neighbor for each of a full set of candidates.
	Fortunately, there's a SQL language feature that allows us to run a query repeatedly driven in a loop: the `LATERAL join <https://medium.com/kkempin/postgresqls-lateral-join-bfd6bd0199df>`_.
	Here we will find the nearest street to each subway station:
	Note the way the ``CROSS JOIN LATERAL`` acts as the inner part of a loop driven by the subways table. Each record in the subways table gets fed into the lateral subquery, one at a time, so you get a nearest result for each subway record.
	The explain shows the loop on the subway stations, and the index-assisted order by inside the loop where we want it:

Loading…

lefcgis

Translation changed

English

Spanish 47 characters edited Current translation Translated

a year ago

lefcgis

Translation added

English

Spanish 119 characters edited Translated

a year ago

Browse all string changes

Things to check

Mismatched full stop

Source and translation do not both end with a full stop

Reset

Glossary

English	Spanish
No related strings found in the glossary.

String information

Source string location

../../en/knn.rst:9

String age

3 years ago

Last updated

a year ago

Source string age

3 years ago

Translation file

postgis-intro/sources/locale/es/LC_MESSAGES/knn.po, string 3