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

DOI10.1007/11751649_5zbMATH Open1175.68132OpenAlexW1602561898MaRDI QIDQ3603019

Chun Chen, Gencai Chen, Yunjun Gao, Ling 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) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)

Related Items (1)

Fast spatial decomposition and closest pair computation for limited precision input

Recommendations

• Title not available (Why is that?) 👍 👎
• Efficient algorithms and cost models for reverse spatial-keyword \(k\)-nearest neighbor search 👍 👎
• Parallel algorithms for nearest neighbor search problems in high dimensions 👍 👎
• Efficient computation of a proximity matching in spatial databases 👍 👎
• Processing constrainedK closest pairs query in spatial databases 👍 👎

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)