A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks

Query processing in road networks has been studied extensively in recent years. However, the processing of moving queries in road networks has received little attention. In this paper, we introduce a new algorithm called the Safe Exit Algorithm (SEA), which can efficiently compute the safe exit poin...

Full description

Bibliographic Details
Main Authors: Hyung-Ju Cho, Se Jin Kwon, Tae-Sun Chung
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Mobile Information Systems
Online Access:http://dx.doi.org/10.3233/MIS-2012-0146
id doaj-b163b306586846249122130ec851200c
record_format Article
spelling doaj-b163b306586846249122130ec851200c2021-07-02T07:23:23ZengHindawi LimitedMobile Information Systems1574-017X1875-905X2013-01-0191375310.3233/MIS-2012-0146A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road NetworksHyung-Ju Cho0Se Jin Kwon1Tae-Sun Chung2Department of Information & Computer Engineering, Ajou University Woncheon-dong, Suwon Si Yeongtong-gu, Gyeonggi-Do, Republic of KoreaDepartment of Information & Computer Engineering, Ajou University Woncheon-dong, Suwon Si Yeongtong-gu, Gyeonggi-Do, Republic of KoreaDepartment of Information & Computer Engineering, Ajou University Woncheon-dong, Suwon Si Yeongtong-gu, Gyeonggi-Do, Republic of KoreaQuery processing in road networks has been studied extensively in recent years. However, the processing of moving queries in road networks has received little attention. In this paper, we introduce a new algorithm called the Safe Exit Algorithm (SEA), which can efficiently compute the safe exit points of a moving nearest neighbor (NN) query on road networks. The safe region of a query is an area where the query result remains unchanged, provided that the query remains inside the safe region At each safe exit point, the safe region of a query and its non-safe region meet so that a set of safe exit points represents the border of the safe region. Before reaching a safe exit point, the client (query object) does not have to request the server to re-evaluate the query This significantly reduces the server processing costs and the communication costs between the server and moving clients. Extensive experimental results show that SEA outperforms a conventional algorithm by up to two orders of magnitude in terms of communication costs and computation costs.http://dx.doi.org/10.3233/MIS-2012-0146
collection DOAJ
language English
format Article
sources DOAJ
author Hyung-Ju Cho
Se Jin Kwon
Tae-Sun Chung
spellingShingle Hyung-Ju Cho
Se Jin Kwon
Tae-Sun Chung
A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks
Mobile Information Systems
author_facet Hyung-Ju Cho
Se Jin Kwon
Tae-Sun Chung
author_sort Hyung-Ju Cho
title A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks
title_short A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks
title_full A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks
title_fullStr A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks
title_full_unstemmed A Safe Exit Algorithm for Continuous Nearest Neighbor Monitoring in Road Networks
title_sort safe exit algorithm for continuous nearest neighbor monitoring in road networks
publisher Hindawi Limited
series Mobile Information Systems
issn 1574-017X
1875-905X
publishDate 2013-01-01
description Query processing in road networks has been studied extensively in recent years. However, the processing of moving queries in road networks has received little attention. In this paper, we introduce a new algorithm called the Safe Exit Algorithm (SEA), which can efficiently compute the safe exit points of a moving nearest neighbor (NN) query on road networks. The safe region of a query is an area where the query result remains unchanged, provided that the query remains inside the safe region At each safe exit point, the safe region of a query and its non-safe region meet so that a set of safe exit points represents the border of the safe region. Before reaching a safe exit point, the client (query object) does not have to request the server to re-evaluate the query This significantly reduces the server processing costs and the communication costs between the server and moving clients. Extensive experimental results show that SEA outperforms a conventional algorithm by up to two orders of magnitude in terms of communication costs and computation costs.
url http://dx.doi.org/10.3233/MIS-2012-0146
work_keys_str_mv AT hyungjucho asafeexitalgorithmforcontinuousnearestneighbormonitoringinroadnetworks
AT sejinkwon asafeexitalgorithmforcontinuousnearestneighbormonitoringinroadnetworks
AT taesunchung asafeexitalgorithmforcontinuousnearestneighbormonitoringinroadnetworks
AT hyungjucho safeexitalgorithmforcontinuousnearestneighbormonitoringinroadnetworks
AT sejinkwon safeexitalgorithmforcontinuousnearestneighbormonitoringinroadnetworks
AT taesunchung safeexitalgorithmforcontinuousnearestneighbormonitoringinroadnetworks
_version_ 1721336176753770496