.png){kind=icon}
Return
Efficient parallel processing of high-dimensional spatial kNN queries
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-022-07081-0.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Some efficient top-k algorithms, i.e., Fagin's Algorithm, threshold algorithm (TA), and best position algorithm (BPA), can be used to answer k nearest neighbor (kNN) queries. However, extending the existing algorithms without further changes to the algorithms themselves would not be efficient since there are the different characteristics between the kNN queries and top-k queries. For example, the kNN queries are more distance-sensitive rather than the position of data points. Second, it is necessary to add some novel parallel heuristics and pruning policies for the kNN queries. Third, there are still many redundant random accesses among FA, TA, and BPA. In this paper, we address aforementioned these problems and take these algorithms to answer parallel kNN (PkNN) queries in spatial databases. We integrate the advantages of the B + -tree and Open MP programming and propose three efficient parallel kNN query algorithms, namely distance priority-based PkNN, optimized PkNN, and partition-based PkNN. Our performance evaluation shows that our proposed algorithms achieve significant improvement in comparison with existing algorithms, i.e., BPA and BPA2. In addition, our approaches are also capable of returning kNN results incrementally which greatly shorten the query response time and enhance user experience.
Keywords:
Nearest neighbor queries
Parallel
Algorithm
Performance
Spatial database
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveHybrid KNN-join: Parallel nearest neighbor searches exploiting CPU and GPU architectural features
OAAI
OAAIShareSaveShareSave
View more