HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/2270
Title: Reverse nearest neighbors in large graphs
Authors: Yiu, Man Lung
Papadias, Dimitris
Mamoulis, Nikos
Tao, Yufei
Keywords: Reverse nearest neighbors
Query
Large graphs
Issue Date: Apr-2005
Citation: Proceedings of the 21st International Conference on Data Engineering, April 5-8, 2005, p. 186-187
Abstract: 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.
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.
URI: http://hdl.handle.net/1783.1/2270
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
ICDE05RNN.pdfpre-published version40KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.