Cluster Nested Loop <i>k</i>-Farthest Neighbor Join Algorithm for Spatial Networks
This paper considers <i>k</i>-farthest neighbor (<i>k</i>FN) join queries in spatial networks where the distance between two points is the length of the shortest path connecting them. Given a positive integer <i>k</i>, a set of query points <i>Q</i>, and a set of data points <i>P</i>, the <i>k</i>FN...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2022-02-01
|
| Serie: | ISPRS International Journal of Geo-Information |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/2220-9964/11/2/123 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|