Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/2270

Reverse nearest neighbors in large graphs

Authors Yiu, M.L.
Mamoulis, N.
Papadias, D.
Tao, Y.
Issue Date 2005
Source Proceedings - International Conference on Data Engineering , 2005, p. 186-187
Summary A reverse nearest neighbor query returns the data objects that have a query point as their nearest neighbor. Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we propose algorithms and optimization techniques for RNN queries by utilizing some characteristics of networks. © 2005 IEEE.
Subjects
ISSN 1084-4627
Rights © 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Conference paper
Access View full-text via Scopus
Find@HKUST
Files in this item:
File Description Size Format
ICDE05RNN.pdf 40979 B Adobe PDF