Name
Abstract | ||
|---|---|---|
As a major type of continuous spatial queries, the moving $k$ nearest neighbor ($k$ NN) query has been studied extensively. However, most existing studies have focused on only the query efficiency. In this paper, we consider further the usability of the query results, in particular the diversification of the returned data points. We thereby formulate a new type of query named the moving $k$ diversified nearest neighbor query (M$k$ DNN). This type of query continuously reports the $k$ diversified nearest neighbors while the query object is moving. Here, the degree of diversity of the $k$ NN set is defined on the distance between the objects in the $k$ NN set. Computing the $k$ diversified nearest neighbors is an NP-hard problem. We propose an algorithm to maintain incrementally the $k$ diversified nearest neighbors to reduce the query processing costs. We further propose two approximate algorithms to obtain even higher query efficiency with precision bounds. We verify the effectiveness and efficiency of the proposed algorithms both theoretically and empirically. The results confirm the superiority of the proposed algorithms over the baseline algorithm. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TKDE.2016.2593464 | IEEE Trans. Knowl. Data Eng. |
Keywords | DocType | Volume |
Approximation algorithms,Prefetching,Nearest neighbor searches,Usability,Query processing,Trajectory,Indexes | Conference | 28 |
Issue | ISSN | Citations |
10 | 1041-4347 | 5 |
PageRank | References | Authors |
0.42 | 14 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Gu | 1 | 201 | 34.98 |
| Guanli Liu | 2 | 5 | 0.42 |
| Jianzhong Qi | 3 | 171 | 16.11 |
| Hongfei Xu | 4 | 5 | 1.10 |
| Ge YU | 5 | 1313 | 175.88 |
| Rui Zhang | 6 | 308 | 22.87 |