Πλοήγηση ανά Θέμα "Spatial data structure"
Αποτελέσματα 1-2 από 2
-
The K group nearest-neighbor query on non-indexed RAM-resident data
(2016)Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query ... -
Plane-sweep algorithms for the K Group Nearest-Neighbor Query
(2015)One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications ...