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

References

[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

RIGHTS & PERMISSIONS

2019 Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature