Reverse nearest neighbors in large graphs

Man Lung Yiu; Nikos Mamoulis; Dimitris Papadias; Yufei Tao

doi:10.1109/ICDE.2005.124

Reverse nearest neighbors in large graphs

Man Lung Yiu
, Nikos Mamoulis
, Dimitris Papadias
, Yufei Tao

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

24 Citations (Scopus)

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. © 2005 IEEE.

Original language	English
Title of host publication	Proceedings - 21st International Conference on Data Engineering, ICDE 2005
Pages	186-187
DOIs	https://doi.org/10.1109/ICDE.2005.124
Publication status	Published - 2005
Externally published	Yes
Event	21st International Conference on Data Engineering, ICDE 2005 - Tokyo, Japan Duration: 5 Apr 2005 → 8 Apr 2005 https://ieeexplore.ieee.org/xpl/conhome/9680/proceeding

Publication series

Name	Proceedings - International Conference on Data Engineering
ISSN (Print)	1084-4627

Conference

Conference	21st International Conference on Data Engineering, ICDE 2005
Place	Japan
City	Tokyo
Period	5/04/05 → 8/04/05
Internet address	https://ieeexplore.ieee.org/xpl/conhome/9680/proceeding

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Access Output

10.1109/ICDE.2005.124

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{9471addeb8384e0985d90911a68c2274,

title = "Reverse nearest neighbors in large graphs",

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. {\textcopyright} 2005 IEEE.",

author = "Yiu, \{Man Lung\} and Nikos Mamoulis and Dimitris Papadias and Yufei Tao",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 21st International Conference on Data Engineering, ICDE 2005 ; Conference date: 05-04-2005 Through 08-04-2005",

year = "2005",

doi = "10.1109/ICDE.2005.124",

language = "English",

isbn = "0769522858",

series = "Proceedings - International Conference on Data Engineering",

pages = "186--187",

booktitle = "Proceedings - 21st International Conference on Data Engineering, ICDE 2005",

url = "https://ieeexplore.ieee.org/xpl/conhome/9680/proceeding",

}

Reverse nearest neighbors in large graphs. / Yiu, Man Lung; Mamoulis, Nikos; Papadias, Dimitris et al.
Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. p. 186-187 (Proceedings - International Conference on Data Engineering).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Reverse nearest neighbors in large graphs

AU - Yiu, Man Lung

AU - Mamoulis, Nikos

AU - Papadias, Dimitris

AU - Tao, Yufei

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/28444465116

UR - https://www.scopus.com/pages/publications/28444465116#tab=impact

U2 - 10.1109/ICDE.2005.124

DO - 10.1109/ICDE.2005.124

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0769522858

T3 - Proceedings - International Conference on Data Engineering

SP - 186

EP - 187

BT - Proceedings - 21st International Conference on Data Engineering, ICDE 2005

T2 - 21st International Conference on Data Engineering, ICDE 2005

Y2 - 5 April 2005 through 8 April 2005

ER -

Reverse nearest neighbors in large graphs

Abstract

Publication series

Conference

Bibliographical note

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this