• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.223-224
• /
• 2021

Recently, k-farthest neighbor (kFN) queries have not as much attention as k-nearest neighbor (kNN) queries. Therefore, this study considers moving k-farthest neighbor (MkFN) queries for spatial network databases. Given a positive integer k, a moving query point q, and a set of data points P, MkFN queries can constantly retrieve k data points that are farthest from the query point q. The challenge with processing MkFN queries in spatial networks is to avoid unnecessary or superfluous distance calculations between the query and associated data points. This study proposes a batch processing algorithm, called MOFA, to enable efficient processing of MkFN queries in spatial networks. MOFA aims to avoid dispensable distance computations based on the clustering of both query and data points. Moreover, a time complexity analysis is presented to clarify the effect of the clustering method on the query processing time. Extensive experiments using real-world roadmaps demonstrated the efficiency and scalability of the MOFA when compared with a conventional solution.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.196-200
• /
• 2008

Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route-based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.63-74
• /
• 2021

Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.59-71
• /
• 2004

Nearest neighbor query retrieves nearest located target objects, and is very frequently used in mobile environment. In this paper we propose a novel neatest neighbor query processing technique that is able to retrieve nearest located target object from the user who is continuously moving with a direction. The proposed method retrieves objects using the direction property of moving object as well as euclidean distance to target object. The proposed method is applicable to traffic information system, travel information system, and location-based recommendation system which require retrieving nearest located object.

• Journal of Wetlands Research
• /
• v.16 no.1
• /
• pp.103-112
• /
• 2014

Area average rainfall estimation is important to determine the exact amount of the available water resources and the essential input data for rainfall-runoff analysis. Like that, the necessary criterion for accurate area average rainfall estimate is the uniform spatial distribution of raingauge network. In this study, we suggest the spatial distribution evaluation methodology of raingauge network to estimate better area average rainfall and after the suggested method is applied to Han River and Geum River basin. The spatial distribution of rainfall network can be quantified by the nearest neighbor index. In order to evaluate the effects of the spatial distribution of rainfall network by each basin, area average rainfall was estimated by arithmetic mean method, the Thiessen's weighting method and estimation theory for 2013's rainfall event, and evaluated the involved errors by each cases. As a result, it can be found that the estimation error at the best basin of spatial distribution was lower than the worst basin of spatial distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2548-2566
• /
• 2012

This paper derives two main end-to-end performance metrics, namely the spatial capacity density and the average end-to-end delay of the multi-hop wireless ad hoc networks with multi-antenna communications. Based on the closed-form expressions of these performance metrics, three hopping strategies, i.e., the closest neighbor, the furthest neighbor and the randomly selected neighbor hopping strategies have been investigated. This formulation provides insights into the relations among node density, diversity gains, number of hops and some other network design parameters which jointly determine network performances, and a method of choosing the best hopping strategy which can be formulated from a network design perspective.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.715-717
• /
• 2003

Some previous works for nearest neighbor (NN) query processing technique can treat a case that query/data are both moving objects. However, they cannot find exact result owing to vagueness of criterion. In order to escape their limitations and get exact result, we propose new NN query techniques, exact CTNN (continuous trajectory NN) query, approximate CTNN query, and dynamic CTNN query. These are all superior to pervious works, by reducing of number of calculation, considering of trajectory information, and using of continuous query concept. Using these techniques, we can solve any situations and types of NN query in location-aware environment.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.32-41
• /
• 1999

In spatial database system, the nearest neighbor query occurs frequently and requires the processing cost higher than other spatial queries do. The number of nodes to be searched in the index can be minimized for optimizing the cost of processing the nearest neighbor query. The optimal search distance is pr9posed for the measurement of a search distance to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we prove properties of the optimal search distance in N-dimensional. We show through experiments that the performance of query processing of our method is superior to other method using maximum search distance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2256-2262
• /
• 2015

Recently, device-to-device (D2D) communication has been considered as key technology for future cellular system, because it can solve the problem of excessive data traffic increment and can also provide new communication services. Herein, we propose new neighbor discovery for D2D communication and examine its performance. Our proposed scheme is proximity beacon based discovery in which wireless resource for pilot transmission is assigned based on the spatial correlation of wireless channel and sensing period is adjusted according to target accuracy such that power consumption can be reduced. The performance of our propose scheme is analyzed mathematically and verified through computer simulations.

• Journal of Forest and Environmental Science
• /
• v.34 no.6
• /
• pp.419-428
• /
• 2018

Spatial point-patterns analyses were conducted to provide insight into the ecological process behind competition and mortality in two lodgepole pine (Pinus contorta Dougl. ex Loud. var. latifolia Engelm.) stands, one in the Lower Foothills, and the other in the Upper Foothills natural subregions in the boreal forest of Alberta, Canada. Spatial statistical tests were applied to live and dead trees and included Clark-Evans nearest neighbor statistic (R), nearest neighbor distribution function (G(r)), and a variant of Ripley's K function (L(r)). In both lodgepole pine plots, the results indicated that there was significant regularity in the spatial point-pattern of the surviving trees which indicates that competition has been a key driver of mortality and forest dynamics in these plots. Dead trees generally showed a clumping pattern in higher density patches. There were also significant bivariate relationships between live and dead trees, but the relationships differed by natural subregion. In the Lower Foothills plot there was significant attraction between live and dead tees which suggests mainly one-sided competition for light. In contrast, in the Upper Foothills plot, there was significant repulsion between live and dead trees which suggests two-sided competition for soil nutrients and soil moisture.