Search reverse nearest neighbor query on air

InHo Jang, Sang-Geun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

A reverse nearest neighbor (RNN) search retrieves all points in a given data set whose nearest neighbor is a given query point. It is important for location-based services such as traffic monitoring and enhanced 911 service and mixed-reality games. The reverse nearest neighbor queries appear in many practical situations. Existing algorithms have been proposed recently to support RNN search in the traditional client-server service model. In this paper, we conduct a preliminary study on RNN search in wireless data broadcast environments. We employ three air indexing techniques, namely, a naive air index, Rdnn-tree air index and D-tree air index, and devise algorithms based on these techniques to search RNNs on the air. A simulation is conducted to compare the three air indexing techniques. The result shows that RNN search methods in Rdnn- and D-tree outperform the naive index approach significantly in terms of tuning time.

Original languageEnglish
Title of host publicationProceedings - International Conference on Information Technology-New Generations, ITNG 2007
Pages291-296
Number of pages6
DOIs
Publication statusPublished - 2007 Aug 28
Event4th International Conference on Information Technology-New Generations, ITNG 2007 - Las Vegas, NV, United States
Duration: 2007 Apr 22007 Apr 4

Other

Other4th International Conference on Information Technology-New Generations, ITNG 2007
CountryUnited States
CityLas Vegas, NV
Period07/4/207/4/4

Fingerprint

Air
Location based services
Servers
Tuning
Nearest neighbor search
Monitoring

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Jang, I., & Lee, S-G. (2007). Search reverse nearest neighbor query on air. In Proceedings - International Conference on Information Technology-New Generations, ITNG 2007 (pp. 291-296). [4151699] https://doi.org/10.1109/ITNG.2007.173

Search reverse nearest neighbor query on air. / Jang, InHo; Lee, Sang-Geun.

Proceedings - International Conference on Information Technology-New Generations, ITNG 2007. 2007. p. 291-296 4151699.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jang, I & Lee, S-G 2007, Search reverse nearest neighbor query on air. in Proceedings - International Conference on Information Technology-New Generations, ITNG 2007., 4151699, pp. 291-296, 4th International Conference on Information Technology-New Generations, ITNG 2007, Las Vegas, NV, United States, 07/4/2. https://doi.org/10.1109/ITNG.2007.173
Jang I, Lee S-G. Search reverse nearest neighbor query on air. In Proceedings - International Conference on Information Technology-New Generations, ITNG 2007. 2007. p. 291-296. 4151699 https://doi.org/10.1109/ITNG.2007.173
Jang, InHo ; Lee, Sang-Geun. / Search reverse nearest neighbor query on air. Proceedings - International Conference on Information Technology-New Generations, ITNG 2007. 2007. pp. 291-296
@inproceedings{289957143bd4448caf3b96598ef679dd,
title = "Search reverse nearest neighbor query on air",
abstract = "A reverse nearest neighbor (RNN) search retrieves all points in a given data set whose nearest neighbor is a given query point. It is important for location-based services such as traffic monitoring and enhanced 911 service and mixed-reality games. The reverse nearest neighbor queries appear in many practical situations. Existing algorithms have been proposed recently to support RNN search in the traditional client-server service model. In this paper, we conduct a preliminary study on RNN search in wireless data broadcast environments. We employ three air indexing techniques, namely, a naive air index, Rdnn-tree air index and D-tree air index, and devise algorithms based on these techniques to search RNNs on the air. A simulation is conducted to compare the three air indexing techniques. The result shows that RNN search methods in Rdnn- and D-tree outperform the naive index approach significantly in terms of tuning time.",
author = "InHo Jang and Sang-Geun Lee",
year = "2007",
month = "8",
day = "28",
doi = "10.1109/ITNG.2007.173",
language = "English",
isbn = "0769527760",
pages = "291--296",
booktitle = "Proceedings - International Conference on Information Technology-New Generations, ITNG 2007",

}

TY - GEN

T1 - Search reverse nearest neighbor query on air

AU - Jang, InHo

AU - Lee, Sang-Geun

PY - 2007/8/28

Y1 - 2007/8/28

N2 - A reverse nearest neighbor (RNN) search retrieves all points in a given data set whose nearest neighbor is a given query point. It is important for location-based services such as traffic monitoring and enhanced 911 service and mixed-reality games. The reverse nearest neighbor queries appear in many practical situations. Existing algorithms have been proposed recently to support RNN search in the traditional client-server service model. In this paper, we conduct a preliminary study on RNN search in wireless data broadcast environments. We employ three air indexing techniques, namely, a naive air index, Rdnn-tree air index and D-tree air index, and devise algorithms based on these techniques to search RNNs on the air. A simulation is conducted to compare the three air indexing techniques. The result shows that RNN search methods in Rdnn- and D-tree outperform the naive index approach significantly in terms of tuning time.

AB - A reverse nearest neighbor (RNN) search retrieves all points in a given data set whose nearest neighbor is a given query point. It is important for location-based services such as traffic monitoring and enhanced 911 service and mixed-reality games. The reverse nearest neighbor queries appear in many practical situations. Existing algorithms have been proposed recently to support RNN search in the traditional client-server service model. In this paper, we conduct a preliminary study on RNN search in wireless data broadcast environments. We employ three air indexing techniques, namely, a naive air index, Rdnn-tree air index and D-tree air index, and devise algorithms based on these techniques to search RNNs on the air. A simulation is conducted to compare the three air indexing techniques. The result shows that RNN search methods in Rdnn- and D-tree outperform the naive index approach significantly in terms of tuning time.

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

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

U2 - 10.1109/ITNG.2007.173

DO - 10.1109/ITNG.2007.173

M3 - Conference contribution

AN - SCOPUS:34548125009

SN - 0769527760

SN - 9780769527765

SP - 291

EP - 296

BT - Proceedings - International Conference on Information Technology-New Generations, ITNG 2007

ER -