References
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
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
He Z, Lo E. Answering why-not questions on top-k queries. In: Proceedings of International Conference on Data Engineering. 2012, 750–761
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
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
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
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
Acknowledgements
This research was funded by the National Natural Science Foundation of China (Grant No. 61773167), the Natural Science Foundation of Shanghai (17ZR1444900) and the Science and Technology Commission of Shanghai Municipality (17511102702). The computation was performed in the Supercomputer Center of ECNU.
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Zhong, Z., Lin, X. & He, L. Answering range-based reverse kNN and why-not reverse kNN queries. Front. Comput. Sci. 14, 233–235 (2020). https://doi.org/10.1007/s11704-019-8190-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-019-8190-5