Conference Paper: Reverse nearest neighbors in large graphs

File Download Links for fulltext
(May Require Subscription)
Supplementary

  • Basic View
  • Metadata View
  • XML View
TitleReverse nearest neighbors in large graphs
AuthorsYiu, ML1
Mamoulis, N1
Papadias, D3
Tao, Y2
KeywordsComputers
Computer engineering
Issue Date2005
PublisherIEEE, Computer Society.
CitationProceedings - International Conference On Data Engineering, 2005, p. 186-187 [How to Cite?]
DOI: http://dx.doi.org/10.1109/ICDE.2005.124
AbstractA 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.
ISSN1084-4627
DOIhttp://dx.doi.org/10.1109/ICDE.2005.124
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorYiu, ML
dc.contributor.authorMamoulis, N
dc.contributor.authorPapadias, D
dc.contributor.authorTao, Y
dc.date.accessioned2009-04-03T07:24:29Z
dc.date.available2009-04-03T07:24:29Z
dc.date.issued2005
dc.description.abstractA 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.
dc.description.naturepublished_or_final_version
dc.identifier.citationProceedings - International Conference On Data Engineering, 2005, p. 186-187 [How to Cite?]
DOI: http://dx.doi.org/10.1109/ICDE.2005.124
dc.identifier.doihttp://dx.doi.org/10.1109/ICDE.2005.124
dc.identifier.epage187
dc.identifier.hkuros103364
dc.identifier.issn1084-4627
dc.identifier.openurl
dc.identifier.scopuseid_2-s2.0-28444465116
dc.identifier.spage186
dc.identifier.urihttp://hdl.handle.net/10722/53606
dc.languageeng
dc.publisherIEEE, Computer Society.
dc.publisher.placeUnited States
dc.relation.ispartofProceedings - International Conference on Data Engineering
dc.relation.referencesReferences in Scopus
dc.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.
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License
dc.subjectComputers
dc.subjectComputer engineering
dc.titleReverse nearest neighbors in large graphs
dc.typeConference_Paper
Author Affiliations
  1. The University of Hong Kong
  2. City University of Hong Kong
  3. Hong Kong University of Science and Technology