Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases

DOI10.1007/11751649_5MaRDI QIDQ3603019zbMATH OpenOpenAlexFDO

Authors Yunjun Gao, Ling Chen, Gencai Chen, Chun Chen

Publication date 12 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751649_5

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

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
• scientific article; zbMATH DE number 1832337
• 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
• scientific article; zbMATH DE number 1953052 (Why is no real title available?)
• Nearest Neighbor Search
• An algorithm for processing the k-nearest join based on an R-tree in MapReduce
• Processing constrainedK closest pairs query in spatial databases
• Computational Science – ICCS 2005
• 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)