A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Nearest group queries
2013
Proceedings of the 25th International Conference on Scientific and Statistical Database Management - SSDBM
k nearest neighbor (kNN) search is an important problem in a vast number of applications, including clustering, pattern recognition, image retrieval and recommendation systems. It finds k elements from a data source D that are closest to a given query point q in a metric space. In this paper, we extend kNN query to retrieve closest elements from multiple data sources. This new type of query is named k nearest group (kNG) query, which finds k groups of elements that are closest to q with each
doi:10.1145/2484838.2484866
dblp:conf/ssdbm/ZhangCT13
fatcat:qk5vo4juwjfudl2tzyjp6rk6ey