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: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › 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.

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

Conference

Conference	21st International Conference on Data Engineering, ICDE 2005
Country/Territory	Japan
City	Tokyo
Period	5/04/05 → 8/04/05

ASJC Scopus subject areas

Software
Signal Processing
Information Systems

More information

10.1109/ICDE.2005.124

Cite this

@inproceedings{a5c60399c05846549dcc01705ca50cc8,

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.",

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

year = "2005",

month = dec,

day = "12",

doi = "10.1109/ICDE.2005.124",

language = "English",

isbn = "0769522858",

pages = "186--187",

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

note = "21st International Conference on Data Engineering, ICDE 2005 ; Conference date: 05-04-2005 Through 08-04-2005",

}

TY - GEN

T1 - Reverse nearest neighbors in large graphs

AU - Yiu, Man Lung

AU - Mamoulis, Nikos

AU - Papadias, Dimitris

AU - Tao, Yufei

PY - 2005/12/12

Y1 - 2005/12/12

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.

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.

UR - http://www.scopus.com/inward/record.url?scp=28444465116&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2005.124

DO - 10.1109/ICDE.2005.124

M3 - Conference article published in proceeding or book

SN - 0769522858

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

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this