This paper proposes a fast safe-region generation method for several kinds of vicinity queries including set k nearest neighbor (NN) queries, ordered kNN queries, reverse kNN queries, and distance range queries. When a user is driving a car on a road network, he/she wants to know about objects located in the vicinity of the car. However, the result changes according to the movement of the car, and therefore, the user needs to request up-to-date result to the server. On the other hand, frequent requests for up-to-date results cause heavy loadings on the server. To cope with this problem efficiently, the idea of the safe-region has been proposed, however, it takes long processing time in existing works. This paper proposes a fast generation method of the safe-region applicable to several types of vicinity queries. Through experimental evaluations, we demonstrate that the proposed method outperforms the existing algorithms in the processing time by one or two orders of magnitude.
Tin Nilar WIN
Saitama University
Htoo HTOO
Saitama University
Yutaka OHSAWA
Saitama University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tin Nilar WIN, Htoo HTOO, Yutaka OHSAWA, "Safe-Region Generation Method for Versatile Continuous Vicinity Queries in the Road Network Distance" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 2, pp. 472-480, February 2018, doi: 10.1587/transfun.E101.A.472.
Abstract: This paper proposes a fast safe-region generation method for several kinds of vicinity queries including set k nearest neighbor (NN) queries, ordered kNN queries, reverse kNN queries, and distance range queries. When a user is driving a car on a road network, he/she wants to know about objects located in the vicinity of the car. However, the result changes according to the movement of the car, and therefore, the user needs to request up-to-date result to the server. On the other hand, frequent requests for up-to-date results cause heavy loadings on the server. To cope with this problem efficiently, the idea of the safe-region has been proposed, however, it takes long processing time in existing works. This paper proposes a fast generation method of the safe-region applicable to several types of vicinity queries. Through experimental evaluations, we demonstrate that the proposed method outperforms the existing algorithms in the processing time by one or two orders of magnitude.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.472/_p
Copy
@ARTICLE{e101-a_2_472,
author={Tin Nilar WIN, Htoo HTOO, Yutaka OHSAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Safe-Region Generation Method for Versatile Continuous Vicinity Queries in the Road Network Distance},
year={2018},
volume={E101-A},
number={2},
pages={472-480},
abstract={This paper proposes a fast safe-region generation method for several kinds of vicinity queries including set k nearest neighbor (NN) queries, ordered kNN queries, reverse kNN queries, and distance range queries. When a user is driving a car on a road network, he/she wants to know about objects located in the vicinity of the car. However, the result changes according to the movement of the car, and therefore, the user needs to request up-to-date result to the server. On the other hand, frequent requests for up-to-date results cause heavy loadings on the server. To cope with this problem efficiently, the idea of the safe-region has been proposed, however, it takes long processing time in existing works. This paper proposes a fast generation method of the safe-region applicable to several types of vicinity queries. Through experimental evaluations, we demonstrate that the proposed method outperforms the existing algorithms in the processing time by one or two orders of magnitude.},
keywords={},
doi={10.1587/transfun.E101.A.472},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Safe-Region Generation Method for Versatile Continuous Vicinity Queries in the Road Network Distance
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 472
EP - 480
AU - Tin Nilar WIN
AU - Htoo HTOO
AU - Yutaka OHSAWA
PY - 2018
DO - 10.1587/transfun.E101.A.472
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2018
AB - This paper proposes a fast safe-region generation method for several kinds of vicinity queries including set k nearest neighbor (NN) queries, ordered kNN queries, reverse kNN queries, and distance range queries. When a user is driving a car on a road network, he/she wants to know about objects located in the vicinity of the car. However, the result changes according to the movement of the car, and therefore, the user needs to request up-to-date result to the server. On the other hand, frequent requests for up-to-date results cause heavy loadings on the server. To cope with this problem efficiently, the idea of the safe-region has been proposed, however, it takes long processing time in existing works. This paper proposes a fast generation method of the safe-region applicable to several types of vicinity queries. Through experimental evaluations, we demonstrate that the proposed method outperforms the existing algorithms in the processing time by one or two orders of magnitude.
ER -