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

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

doi:10.1109/ICECENG.2011.6058108

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 proceeding › Conference 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 language	English
Title of host publication	2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings
Pages	4838-4841
Number of pages	4
DOIs	https://doi.org/10.1109/ICECENG.2011.6058108
Publication status	Published - 2011
Event	2nd Annual Conference on Electrical and Control Engineering, ICECE 2011 - Yichang, China Duration: 2011 Sept 16 → 2011 Sept 18

Publication series

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

Other

Other	2nd Annual Conference on Electrical and Control Engineering, ICECE 2011
Country/Territory	China
City	Yichang
Period	11/9/16 → 11/9/18

Keywords

augmented reality
location based service
nearest neighbor queries
spatial data

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/ICECENG.2011.6058108

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). Article 6058108 (2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings). 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 et al.
2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings. 2011. p. 4838-4841 6058108 (2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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, 2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings, 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

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

doi = "10.1109/ICECENG.2011.6058108",

language = "English",

isbn = "9781424481637",

series = "2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings",

pages = "4838--4841",

booktitle = "2011 International Conference on Electrical and Control Engineering, ICECE 2011 - Proceedings",

note = "2nd Annual Conference on Electrical and Control Engineering, ICECE 2011 ; Conference date: 16-09-2011 Through 18-09-2011",

}

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

Y1 - 2011

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

U2 - 10.1109/ICECENG.2011.6058108

DO - 10.1109/ICECENG.2011.6058108

M3 - Conference contribution

AN - SCOPUS:80955128572

SN - 9781424481637

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

SP - 4838

EP - 4841

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

T2 - 2nd Annual Conference on Electrical and Control Engineering, ICECE 2011

Y2 - 16 September 2011 through 18 September 2011

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this