Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
From MaRDI portal
Recommendations
- Efficient computation of a proximity matching in spatial databases
- Parallel algorithms for nearest neighbor search problems in high dimensions
- Processing constrainedK closest pairs query in spatial databases
- Efficient processing of large spatial queries using interior approximations
- Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search
Cited in
(10)- Fast spatial decomposition and closest pair computation for limited precision input
- An efficient index structure for distributed \(k\)-nearest neighbours query processing
- A model for k-nearest neighbor query processing cost in multidimensional data space
- Answering k-NN query of Chinese calligraphic character based on data grid
- Search K nearest neighbors on air
- Nearest neighbor search. A database perspective.
- An algorithm for processing the k-nearest join based on an R-tree in MapReduce
- Processing constrainedK closest pairs query in spatial databases
- Efficient parallelization of spatial approximation trees
- Parallel nearest neighbors in low dimensions with batch updates
This page was built for publication: Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603019)