Answering range-based reverse kNN and why-not reverse kNN queries

Zhefan ZHONG; Xin LIN; Liang HE

doi:10.1007/s11704-019-8190-5

Front. Comput. Sci. ›› 2020, Vol. 14 ›› Issue (1) : 233 -235. DOI: 10.1007/s11704-019-8190-5

LETTER

Answering range-based reverse kNN and why-not reverse kNN queries

Author information +

History +

PDF (185KB)

Cite this article

Download citation ▾

Zhefan ZHONG, Xin LIN, Liang HE. Answering range-based reverse kNN and why-not reverse kNN queries. Front. Comput. Sci., 2020, 14(1): 233-235 DOI:10.1007/s11704-019-8190-5

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Korn F, Muthukrishnan S. Influence sets based on reverse nearest neighbor queries. Journal of Special Interest Group on Management Of Data, 2000, 29(2): 201–212

[2]	Tran Q T, Chan C Y. How to conquer why-not questions. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2010, 15–26

[3]	He Z, Lo E. Answering why-not questions on top-k queries. In: Proceedings of International Conference on Data Engineering. 2012, 750–761

[4]	Stanoi I, Agrawal D, Abbadi A. Reverse nearest neighbor queries for dynamic databases. Journal of Special Interest Group on Management of Data, 2000, 29(5): 44–53

[5]	Singh A, Ferhatosmanoglu H, Tosun A. High dimensional reverse nearest neighbor queries. In: Proceedings of the 12th International Conference on Information Knowledge Management. 2003, 91–98

[6]	Tao Y, Papadias D, Lian X. Reverse kNN search in arbitrary dimensionality. In: Proceedings of the 30th International Conference on Very Large Data Bases. 2004, 744–755

[7]	Beckmann N, Kriegel H P, Schneider R, Seeger B. The R*-tree: an effcient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 1990, 322–331