File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Reverse nearest neighbors in large graphs

TitleReverse nearest neighbors in large graphs
Authors
Yiu, MLMamoulis, NPapadias, DTao, Y
KeywordsComputers
Computer engineering
Issue Date2005
PublisherIEEE, Computer Society.
Citation
Proceedings - 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.
Persistent Identifierhttp://hdl.handle.net/10722/53606
ISSN
1084-4627
2020 SCImago Journal Rankings: 0.436
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorYiu, MLen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorPapadias, Den_HK
dc.contributor.authorTao, Yen_HK
dc.date.accessioned2009-04-03T07:24:29Z-
dc.date.available2009-04-03T07:24:29Z-
dc.date.issued2005en_HK
dc.identifier.citationProceedings - International Conference On Data Engineering, 2005, p. 186-187en_HK
dc.identifier.issn1084-4627en_HK
dc.identifier.urihttp://hdl.handle.net/10722/53606-
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.en_HK
dc.languageengen_HK
dc.publisherIEEE, Computer Society.en_HK
dc.relation.ispartofProceedings - International Conference on Data Engineeringen_HK
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.subjectComputersen_HK
dc.subjectComputer engineeringen_HK
dc.titleReverse nearest neighbors in large graphsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1084-4627&volume=&spage=186&epage=187&date=2005&atitle=Reverse+nearest+neighbors+in+large+graphsen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICDE.2005.124en_HK
dc.identifier.scopuseid_2-s2.0-28444465116en_HK
dc.identifier.hkuros103364-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-28444465116&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage186en_HK
dc.identifier.epage187en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridYiu, ML=8589889600en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK
dc.identifier.scopusauthoridTao, Y=54787029400en_HK
dc.identifier.issnl1084-4627-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats