On processing view field nearest neighbor queries on the R*-tree

Sungmin Yi, Harim Jung, Jun Pyo Park, Yon Dohn Chung

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

2 Citations (Scopus)

Abstract

This paper addresses a new type of spatial queries, called the view field nearest neighbor (VFNN) query. Given a user's location (i.e., query point) and a user's view field (i.e., query view field), VFNN query finds the nearest data object that falls within the user's view field. To support efficient processing of VFNN queries, we utilize the R*-tree, one of the representative multi-dimensional index structures, to index a dataset. We propose the VFNN search algorithm on the R*-tree, which employs (i) a mindist to measure the minimum possible distance from a query point to each data object and (ii) a minangle (maxangle), the minimum (maximum) angle (viewed from the positive x-axis) between the query point and the minimum bounding rectangle (MBR) of each R*-tree node. Through a series of simulations, we study the performance of the proposed search algorithm.

Original languageEnglish
Title of host publication2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings
Pages4838-4841
Number of pages4
DOIs
Publication statusPublished - 2011 Nov 16
Event2nd Annual Conference on Electrical and Control Engineering, ICECE 2011 - Yichang, China
Duration: 2011 Sep 162011 Sep 18

Other

Other2nd Annual Conference on Electrical and Control Engineering, ICECE 2011
CountryChina
CityYichang
Period11/9/1611/9/18

Fingerprint

Trees (mathematics)
Processing
Nearest neighbor search

Keywords

  • augmented reality
  • location based service
  • nearest neighbor queries
  • spatial data

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Yi, S., Jung, H., Park, J. P., & Chung, Y. D. (2011). On processing view field nearest neighbor queries on the R*-tree. In 2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings (pp. 4838-4841). [6058108] https://doi.org/10.1109/ICECENG.2011.6058108

On processing view field nearest neighbor queries on the R*-tree. / Yi, Sungmin; Jung, Harim; Park, Jun Pyo; Chung, Yon Dohn.

2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings. 2011. p. 4838-4841 6058108.

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

Yi, S, Jung, H, Park, JP & Chung, YD 2011, On processing view field nearest neighbor queries on the R*-tree. in 2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings., 6058108, pp. 4838-4841, 2nd Annual Conference on Electrical and Control Engineering, ICECE 2011, Yichang, China, 11/9/16. https://doi.org/10.1109/ICECENG.2011.6058108
Yi S, Jung H, Park JP, Chung YD. On processing view field nearest neighbor queries on the R*-tree. In 2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings. 2011. p. 4838-4841. 6058108 https://doi.org/10.1109/ICECENG.2011.6058108
Yi, Sungmin ; Jung, Harim ; Park, Jun Pyo ; Chung, Yon Dohn. / On processing view field nearest neighbor queries on the R*-tree. 2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings. 2011. pp. 4838-4841
@inproceedings{7a6d0ba9ffc2492a8b64b3445eaa4b43,
title = "On processing view field nearest neighbor queries on the R*-tree",
abstract = "This paper addresses a new type of spatial queries, called the view field nearest neighbor (VFNN) query. Given a user's location (i.e., query point) and a user's view field (i.e., query view field), VFNN query finds the nearest data object that falls within the user's view field. To support efficient processing of VFNN queries, we utilize the R*-tree, one of the representative multi-dimensional index structures, to index a dataset. We propose the VFNN search algorithm on the R*-tree, which employs (i) a mindist to measure the minimum possible distance from a query point to each data object and (ii) a minangle (maxangle), the minimum (maximum) angle (viewed from the positive x-axis) between the query point and the minimum bounding rectangle (MBR) of each R*-tree node. Through a series of simulations, we study the performance of the proposed search algorithm.",
keywords = "augmented reality, location based service, nearest neighbor queries, spatial data",
author = "Sungmin Yi and Harim Jung and Park, {Jun Pyo} and Chung, {Yon Dohn}",
year = "2011",
month = "11",
day = "16",
doi = "10.1109/ICECENG.2011.6058108",
language = "English",
isbn = "9781424481637",
pages = "4838--4841",
booktitle = "2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings",

}

TY - GEN

T1 - On processing view field nearest neighbor queries on the R*-tree

AU - Yi, Sungmin

AU - Jung, Harim

AU - Park, Jun Pyo

AU - Chung, Yon Dohn

PY - 2011/11/16

Y1 - 2011/11/16

N2 - This paper addresses a new type of spatial queries, called the view field nearest neighbor (VFNN) query. Given a user's location (i.e., query point) and a user's view field (i.e., query view field), VFNN query finds the nearest data object that falls within the user's view field. To support efficient processing of VFNN queries, we utilize the R*-tree, one of the representative multi-dimensional index structures, to index a dataset. We propose the VFNN search algorithm on the R*-tree, which employs (i) a mindist to measure the minimum possible distance from a query point to each data object and (ii) a minangle (maxangle), the minimum (maximum) angle (viewed from the positive x-axis) between the query point and the minimum bounding rectangle (MBR) of each R*-tree node. Through a series of simulations, we study the performance of the proposed search algorithm.

AB - This paper addresses a new type of spatial queries, called the view field nearest neighbor (VFNN) query. Given a user's location (i.e., query point) and a user's view field (i.e., query view field), VFNN query finds the nearest data object that falls within the user's view field. To support efficient processing of VFNN queries, we utilize the R*-tree, one of the representative multi-dimensional index structures, to index a dataset. We propose the VFNN search algorithm on the R*-tree, which employs (i) a mindist to measure the minimum possible distance from a query point to each data object and (ii) a minangle (maxangle), the minimum (maximum) angle (viewed from the positive x-axis) between the query point and the minimum bounding rectangle (MBR) of each R*-tree node. Through a series of simulations, we study the performance of the proposed search algorithm.

KW - augmented reality

KW - location based service

KW - nearest neighbor queries

KW - spatial data

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

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

U2 - 10.1109/ICECENG.2011.6058108

DO - 10.1109/ICECENG.2011.6058108

M3 - Conference contribution

AN - SCOPUS:80955128572

SN - 9781424481637

SP - 4838

EP - 4841

BT - 2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings

ER -