In-memory processing for nearest user-specified group search

Hong Jun Jang, Woo Sung Choi, Kyeong Seok Hyun, Taehyung Lim, Soon Young Jung, Jaehwa Chung

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

This paper presents a nearest user-specified group (NUG) search which called a clustered NN problem. Given a set of data points P and a query point q, NUG search finds the nearest subset c ⊂ P (|c| ≥ k) from q (called user-specified group) that satisfies given conditions. Motivated by the brute-force approach for NUG search requires O (|P|2) computational cost, we propose a faster algorithm to handle NUG problem with in-memory processing. We first define clustered objects above k as a user-specified group and the NUG search problem. Moreover, the proposed solution converts a NUG search problem to a graph formulation problem, and reduces processing cost with geometric-based heuristics. Our experimental results show that the efficiency and effectiveness of our proposed approach outperforms the conventional one.

Original languageEnglish
Title of host publicationLecture Notes in Electrical Engineering
PublisherSpringer Verlag
Pages797-803
Number of pages7
Volume373
DOIs
Publication statusPublished - 2015

Publication series

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

Fingerprint

Data storage equipment
Processing
Costs

Keywords

  • K-nearest neighbor query
  • Nearest user-specified group query

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Jang, H. J., Choi, W. S., Hyun, K. S., Lim, T., Jung, S. Y., & Chung, J. (2015). In-memory processing for nearest user-specified group search. In Lecture Notes in Electrical Engineering (Vol. 373, pp. 797-803). (Lecture Notes in Electrical Engineering; Vol. 373). Springer Verlag. https://doi.org/10.1007/978-981-10-0281-6_112

In-memory processing for nearest user-specified group search. / Jang, Hong Jun; Choi, Woo Sung; Hyun, Kyeong Seok; Lim, Taehyung; Jung, Soon Young; Chung, Jaehwa.

Lecture Notes in Electrical Engineering. Vol. 373 Springer Verlag, 2015. p. 797-803 (Lecture Notes in Electrical Engineering; Vol. 373).

Research output: Chapter in Book/Report/Conference proceedingChapter

Jang, HJ, Choi, WS, Hyun, KS, Lim, T, Jung, SY & Chung, J 2015, In-memory processing for nearest user-specified group search. in Lecture Notes in Electrical Engineering. vol. 373, Lecture Notes in Electrical Engineering, vol. 373, Springer Verlag, pp. 797-803. https://doi.org/10.1007/978-981-10-0281-6_112
Jang HJ, Choi WS, Hyun KS, Lim T, Jung SY, Chung J. In-memory processing for nearest user-specified group search. In Lecture Notes in Electrical Engineering. Vol. 373. Springer Verlag. 2015. p. 797-803. (Lecture Notes in Electrical Engineering). https://doi.org/10.1007/978-981-10-0281-6_112
Jang, Hong Jun ; Choi, Woo Sung ; Hyun, Kyeong Seok ; Lim, Taehyung ; Jung, Soon Young ; Chung, Jaehwa. / In-memory processing for nearest user-specified group search. Lecture Notes in Electrical Engineering. Vol. 373 Springer Verlag, 2015. pp. 797-803 (Lecture Notes in Electrical Engineering).
@inbook{d9d6281648ca473c899f15f26c8bacb6,
title = "In-memory processing for nearest user-specified group search",
abstract = "This paper presents a nearest user-specified group (NUG) search which called a clustered NN problem. Given a set of data points P and a query point q, NUG search finds the nearest subset c ⊂ P (|c| ≥ k) from q (called user-specified group) that satisfies given conditions. Motivated by the brute-force approach for NUG search requires O (|P|2) computational cost, we propose a faster algorithm to handle NUG problem with in-memory processing. We first define clustered objects above k as a user-specified group and the NUG search problem. Moreover, the proposed solution converts a NUG search problem to a graph formulation problem, and reduces processing cost with geometric-based heuristics. Our experimental results show that the efficiency and effectiveness of our proposed approach outperforms the conventional one.",
keywords = "K-nearest neighbor query, Nearest user-specified group query",
author = "Jang, {Hong Jun} and Choi, {Woo Sung} and Hyun, {Kyeong Seok} and Taehyung Lim and Jung, {Soon Young} and Jaehwa Chung",
year = "2015",
doi = "10.1007/978-981-10-0281-6_112",
language = "English",
volume = "373",
series = "Lecture Notes in Electrical Engineering",
publisher = "Springer Verlag",
pages = "797--803",
booktitle = "Lecture Notes in Electrical Engineering",

}

TY - CHAP

T1 - In-memory processing for nearest user-specified group search

AU - Jang, Hong Jun

AU - Choi, Woo Sung

AU - Hyun, Kyeong Seok

AU - Lim, Taehyung

AU - Jung, Soon Young

AU - Chung, Jaehwa

PY - 2015

Y1 - 2015

N2 - This paper presents a nearest user-specified group (NUG) search which called a clustered NN problem. Given a set of data points P and a query point q, NUG search finds the nearest subset c ⊂ P (|c| ≥ k) from q (called user-specified group) that satisfies given conditions. Motivated by the brute-force approach for NUG search requires O (|P|2) computational cost, we propose a faster algorithm to handle NUG problem with in-memory processing. We first define clustered objects above k as a user-specified group and the NUG search problem. Moreover, the proposed solution converts a NUG search problem to a graph formulation problem, and reduces processing cost with geometric-based heuristics. Our experimental results show that the efficiency and effectiveness of our proposed approach outperforms the conventional one.

AB - This paper presents a nearest user-specified group (NUG) search which called a clustered NN problem. Given a set of data points P and a query point q, NUG search finds the nearest subset c ⊂ P (|c| ≥ k) from q (called user-specified group) that satisfies given conditions. Motivated by the brute-force approach for NUG search requires O (|P|2) computational cost, we propose a faster algorithm to handle NUG problem with in-memory processing. We first define clustered objects above k as a user-specified group and the NUG search problem. Moreover, the proposed solution converts a NUG search problem to a graph formulation problem, and reduces processing cost with geometric-based heuristics. Our experimental results show that the efficiency and effectiveness of our proposed approach outperforms the conventional one.

KW - K-nearest neighbor query

KW - Nearest user-specified group query

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

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

U2 - 10.1007/978-981-10-0281-6_112

DO - 10.1007/978-981-10-0281-6_112

M3 - Chapter

VL - 373

T3 - Lecture Notes in Electrical Engineering

SP - 797

EP - 803

BT - Lecture Notes in Electrical Engineering

PB - Springer Verlag

ER -