Visible reverse k-nearest neighbor query processing in spatial databases

Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-chien Lee, Ken C.K. Lee, Qing Li

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN query retrieves the points in P that have q as their visible nearest neighbor. We propose an efficient algorithm for VRNN query processing, assuming that P and O are indexed by R-trees. Ourtechniques do not require any preprocessing and employ half-plane property and visibility checkto prune the search space. In addition, we extend our solution to several variations of VRNN queries, including: 1) visible reverse k-nearest neighbor(VRkNN) search, which finds the points in P that have q as one of their k visible nearest neighbors; 2) δ-VRkNN search, which handles VRkNN retrieval with the maximum visible distance δ constraint; and 3) constrained VRkNN (CVRkNN) search, which tackles the VRkNN query with region constraint. Extensive experiments on both real and synthetic data sets have been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.

Original languageEnglish (US)
Article number4912197
Pages (from-to)1314-1327
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume21
Issue number9
DOIs
StatePublished - Sep 1 2009

Fingerprint

Query processing
Visibility
Resource allocation
Marketing
Nearest neighbor search
Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Gao, Yunjun ; Zheng, Baihua ; Chen, Gencai ; Lee, Wang-chien ; Lee, Ken C.K. ; Li, Qing. / Visible reverse k-nearest neighbor query processing in spatial databases. In: IEEE Transactions on Knowledge and Data Engineering. 2009 ; Vol. 21, No. 9. pp. 1314-1327.
@article{6db20ec87bce4cddad50854e7af51bbb,
title = "Visible reverse k-nearest neighbor query processing in spatial databases",
abstract = "Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN query retrieves the points in P that have q as their visible nearest neighbor. We propose an efficient algorithm for VRNN query processing, assuming that P and O are indexed by R-trees. Ourtechniques do not require any preprocessing and employ half-plane property and visibility checkto prune the search space. In addition, we extend our solution to several variations of VRNN queries, including: 1) visible reverse k-nearest neighbor(VRkNN) search, which finds the points in P that have q as one of their k visible nearest neighbors; 2) δ-VRkNN search, which handles VRkNN retrieval with the maximum visible distance δ constraint; and 3) constrained VRkNN (CVRkNN) search, which tackles the VRkNN query with region constraint. Extensive experiments on both real and synthetic data sets have been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.",
author = "Yunjun Gao and Baihua Zheng and Gencai Chen and Wang-chien Lee and Lee, {Ken C.K.} and Qing Li",
year = "2009",
month = "9",
day = "1",
doi = "10.1109/TKDE.2009.113",
language = "English (US)",
volume = "21",
pages = "1314--1327",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "9",

}

Visible reverse k-nearest neighbor query processing in spatial databases. / Gao, Yunjun; Zheng, Baihua; Chen, Gencai; Lee, Wang-chien; Lee, Ken C.K.; Li, Qing.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 9, 4912197, 01.09.2009, p. 1314-1327.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Visible reverse k-nearest neighbor query processing in spatial databases

AU - Gao, Yunjun

AU - Zheng, Baihua

AU - Chen, Gencai

AU - Lee, Wang-chien

AU - Lee, Ken C.K.

AU - Li, Qing

PY - 2009/9/1

Y1 - 2009/9/1

N2 - Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN query retrieves the points in P that have q as their visible nearest neighbor. We propose an efficient algorithm for VRNN query processing, assuming that P and O are indexed by R-trees. Ourtechniques do not require any preprocessing and employ half-plane property and visibility checkto prune the search space. In addition, we extend our solution to several variations of VRNN queries, including: 1) visible reverse k-nearest neighbor(VRkNN) search, which finds the points in P that have q as one of their k visible nearest neighbors; 2) δ-VRkNN search, which handles VRkNN retrieval with the maximum visible distance δ constraint; and 3) constrained VRkNN (CVRkNN) search, which tackles the VRkNN query with region constraint. Extensive experiments on both real and synthetic data sets have been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.

AB - Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN query retrieves the points in P that have q as their visible nearest neighbor. We propose an efficient algorithm for VRNN query processing, assuming that P and O are indexed by R-trees. Ourtechniques do not require any preprocessing and employ half-plane property and visibility checkto prune the search space. In addition, we extend our solution to several variations of VRNN queries, including: 1) visible reverse k-nearest neighbor(VRkNN) search, which finds the points in P that have q as one of their k visible nearest neighbors; 2) δ-VRkNN search, which handles VRkNN retrieval with the maximum visible distance δ constraint; and 3) constrained VRkNN (CVRkNN) search, which tackles the VRkNN query with region constraint. Extensive experiments on both real and synthetic data sets have been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.

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

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

U2 - 10.1109/TKDE.2009.113

DO - 10.1109/TKDE.2009.113

M3 - Article

AN - SCOPUS:68549125078

VL - 21

SP - 1314

EP - 1327

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 9

M1 - 4912197

ER -