Towards nearest collection search on spatial databases

Hong Jun Jang, Woo Sung Choi, Kyeong Seok Hyun, Kyoung Ho Jung, Soon Young Jung, Young Sik Jeong, Jaehwa Chung

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

Abstract

In this paper, for the first time, we present the concept of nearest collection (NC) search. Given a set of spatial data points D and a query point q, a nearest collection search retrieves a certain subset c (|c| = k), called collection from D. We formally define a collection as clustered k objects and the nearest collection search problem. Since the brute-force approach of this problem requires large computational cost, we propose two approaches using database techniques to reduce search space. The first approach is the multiple query method which uses existing method (i.e. k-nearest neighbor query) based on normal R-tree. The second approach is the effective NC query processing based on the branch and bound method using an aggregate R-tree (simply aR-tree). Our experimental results show that the efficiency and effectiveness of our proposed approach.

Original languageEnglish
Title of host publicationLecture Notes in Electrical Engineering
PublisherSpringer Verlag
Pages433-440
Number of pages8
Volume280 LNEE
ISBN (Print)9783642416705
DOIs
Publication statusPublished - 2014
Event8th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2013 - Danang, Viet Nam
Duration: 2013 Dec 182013 Dec 20

Publication series

NameLecture Notes in Electrical Engineering
Volume280 LNEE
ISSN (Print)18761100
ISSN (Electronic)18761119

Other

Other8th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2013
CountryViet Nam
CityDanang
Period13/12/1813/12/20

Fingerprint

Branch and bound method
Query processing
Costs

Keywords

  • K-nearest neighbor query
  • Nearest collection query
  • Spatial database

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Jang, H. J., Choi, W. S., Hyun, K. S., Jung, K. H., Jung, S. Y., Jeong, Y. S., & Chung, J. (2014). Towards nearest collection search on spatial databases. In Lecture Notes in Electrical Engineering (Vol. 280 LNEE, pp. 433-440). (Lecture Notes in Electrical Engineering; Vol. 280 LNEE). Springer Verlag. https://doi.org/10.1007/978-3-642-41671-2_55

Towards nearest collection search on spatial databases. / Jang, Hong Jun; Choi, Woo Sung; Hyun, Kyeong Seok; Jung, Kyoung Ho; Jung, Soon Young; Jeong, Young Sik; Chung, Jaehwa.

Lecture Notes in Electrical Engineering. Vol. 280 LNEE Springer Verlag, 2014. p. 433-440 (Lecture Notes in Electrical Engineering; Vol. 280 LNEE).

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

Jang, HJ, Choi, WS, Hyun, KS, Jung, KH, Jung, SY, Jeong, YS & Chung, J 2014, Towards nearest collection search on spatial databases. in Lecture Notes in Electrical Engineering. vol. 280 LNEE, Lecture Notes in Electrical Engineering, vol. 280 LNEE, Springer Verlag, pp. 433-440, 8th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2013, Danang, Viet Nam, 13/12/18. https://doi.org/10.1007/978-3-642-41671-2_55
Jang HJ, Choi WS, Hyun KS, Jung KH, Jung SY, Jeong YS et al. Towards nearest collection search on spatial databases. In Lecture Notes in Electrical Engineering. Vol. 280 LNEE. Springer Verlag. 2014. p. 433-440. (Lecture Notes in Electrical Engineering). https://doi.org/10.1007/978-3-642-41671-2_55
Jang, Hong Jun ; Choi, Woo Sung ; Hyun, Kyeong Seok ; Jung, Kyoung Ho ; Jung, Soon Young ; Jeong, Young Sik ; Chung, Jaehwa. / Towards nearest collection search on spatial databases. Lecture Notes in Electrical Engineering. Vol. 280 LNEE Springer Verlag, 2014. pp. 433-440 (Lecture Notes in Electrical Engineering).
@inproceedings{effd41e4ca354430b9eac56fc9b01d18,
title = "Towards nearest collection search on spatial databases",
abstract = "In this paper, for the first time, we present the concept of nearest collection (NC) search. Given a set of spatial data points D and a query point q, a nearest collection search retrieves a certain subset c (|c| = k), called collection from D. We formally define a collection as clustered k objects and the nearest collection search problem. Since the brute-force approach of this problem requires large computational cost, we propose two approaches using database techniques to reduce search space. The first approach is the multiple query method which uses existing method (i.e. k-nearest neighbor query) based on normal R-tree. The second approach is the effective NC query processing based on the branch and bound method using an aggregate R-tree (simply aR-tree). Our experimental results show that the efficiency and effectiveness of our proposed approach.",
keywords = "K-nearest neighbor query, Nearest collection query, Spatial database",
author = "Jang, {Hong Jun} and Choi, {Woo Sung} and Hyun, {Kyeong Seok} and Jung, {Kyoung Ho} and Jung, {Soon Young} and Jeong, {Young Sik} and Jaehwa Chung",
year = "2014",
doi = "10.1007/978-3-642-41671-2_55",
language = "English",
isbn = "9783642416705",
volume = "280 LNEE",
series = "Lecture Notes in Electrical Engineering",
publisher = "Springer Verlag",
pages = "433--440",
booktitle = "Lecture Notes in Electrical Engineering",

}

TY - GEN

T1 - Towards nearest collection search on spatial databases

AU - Jang, Hong Jun

AU - Choi, Woo Sung

AU - Hyun, Kyeong Seok

AU - Jung, Kyoung Ho

AU - Jung, Soon Young

AU - Jeong, Young Sik

AU - Chung, Jaehwa

PY - 2014

Y1 - 2014

N2 - In this paper, for the first time, we present the concept of nearest collection (NC) search. Given a set of spatial data points D and a query point q, a nearest collection search retrieves a certain subset c (|c| = k), called collection from D. We formally define a collection as clustered k objects and the nearest collection search problem. Since the brute-force approach of this problem requires large computational cost, we propose two approaches using database techniques to reduce search space. The first approach is the multiple query method which uses existing method (i.e. k-nearest neighbor query) based on normal R-tree. The second approach is the effective NC query processing based on the branch and bound method using an aggregate R-tree (simply aR-tree). Our experimental results show that the efficiency and effectiveness of our proposed approach.

AB - In this paper, for the first time, we present the concept of nearest collection (NC) search. Given a set of spatial data points D and a query point q, a nearest collection search retrieves a certain subset c (|c| = k), called collection from D. We formally define a collection as clustered k objects and the nearest collection search problem. Since the brute-force approach of this problem requires large computational cost, we propose two approaches using database techniques to reduce search space. The first approach is the multiple query method which uses existing method (i.e. k-nearest neighbor query) based on normal R-tree. The second approach is the effective NC query processing based on the branch and bound method using an aggregate R-tree (simply aR-tree). Our experimental results show that the efficiency and effectiveness of our proposed approach.

KW - K-nearest neighbor query

KW - Nearest collection query

KW - Spatial database

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

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

U2 - 10.1007/978-3-642-41671-2_55

DO - 10.1007/978-3-642-41671-2_55

M3 - Conference contribution

AN - SCOPUS:84958545106

SN - 9783642416705

VL - 280 LNEE

T3 - Lecture Notes in Electrical Engineering

SP - 433

EP - 440

BT - Lecture Notes in Electrical Engineering

PB - Springer Verlag

ER -