• Spatial Information Research
• /
• v.20 no.2
• /
• pp.137-153
• /
• 2012

Until now, many indexing methods that can reduce update cost have been proposed for managing massive moving objects. Because indexing methods for moving objects have to be updated periodically for managing moving objects that change their location data frequently. However these kinds indexing methods occur big load that exceed system capacity when the number of moving objects increase dramatically. In this paper, we propose the update frequency reducing method to combine MapReduce and existing indices. We use the update request grouping method for each moving object by using MapReduce. We decide to update by comparing the latest data and the oldest data in grouping data. We reduce update frequency by updating the latest data only. When update is delayed, for the data should not be lost and updated periodically, we store the data in a certain period of time in the hash table that keep previous update data. By the performance evaluation, we can prove that the proposed method reduces the update frequency by comparison with methods that are not applied the proposed method.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.479-486
• /
• 2014

MapReduce is a programing model used for parallelly processing a large amount of data. To analyze a large amount data, the data cube is widely used, which is an operator that computes group-bys for all possible combinations of given dimension attributes. When the number of dimension attributes is n, the data cube computes $2^n$ group-bys. In this paper, we propose an efficient method for computing data cubes using MapReduce. The proposed method partitions $2^n$ group-bys into $_nC_{{\lceil}n/2{\rceil}}$ batches, and computes those batches in stages using ${\lceil}n/2{\rceil}$ MapReduce jobs. Compared to the existing methods, the proposed method significantly reduces the amount of intermediate data generated by mappers, so that the cost of sorting and transferring those intermediate data is reduced significantly. Consequently, the total processing time for computing a data cube is reduced. Through experiments, we show the efficiency of the proposed method over the existing methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.11 no.2
• /
• pp.43-51
• /
• 1993

It is very important entity that a map of urban facility is in civic life and development of city. But now, there are many needs of computerization which was used for management of urban facility map because inefficiency was produced due to management of urban facility map by hand. This paper, it was showed that a processing of establishing database in computer by applying GIS. The used sample area in studying in Ansan city in Kyunggi province and a sewer pipe which was in there adapted to establish database in computer. A map of administration district, which is 1:38,000, a map of complex urban planning of city, which is 1:3,000, and the facility map were used for the input of spatial data and the address, the year when sewer pipe was burried, and the quality of pipe, the pipe diameter, and the length of pipe were used as attribute data. Relational structure was used for establishment of database then, searching, analyzing, and processing were possible. Additionary, the result of this studying can be used for replacement of a old sewer pipe, a material quantity which is related with repairement of sewer pipe, and calculation of time, cost by application program framed by Fortran.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.4 s.38
• /
• pp.53-60
• /
• 2006

The purpose of this paper is forcasting of flooding area using LiDAR surveying data, and flood map for damage prevention is established for this purpose. Teahwa river at Ulsan city was chosen as test area and the flood simulation was produced in this area. For the flood simulation, each DEM using LiDAR data and digital map was established and then HEC model program and MIKE program was used to decide the amount of flood flowing and flood height. To improve the rainfall-overflow simulation confidence using inspection comparison of LiDAR data this paper analyzed and compared the LiDAR DEM accuracy and 1/5000 digital map DEM. The height accuracy is important factor to make flood map, however, LiDAR survey execution of all river area is not economic so, LiDAR survey execution of only important area is possible to be make high accuracy and economic flood map. The expectation effect of flood simulation is flood damage prevention and economic savings of recovery cost by forcasting of rainfall-overflow area and establishment of counter-measure.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.2 s.40
• /
• pp.3-14
• /
• 2007

This study proposes an automatic method to generate 3D building models using a draft map, which is an intermediate product generated during the map generation process based on aerial photos. The proposed method is to generate a terrain model, roof models, and wall models sequentially from the limited 3D information extracted from an existing draft map. Based on the planar fitting error of the roof corner points, the roof model is generated as a single planar facet or a multiple planar structure. The first type is derived using a robust estimation method while the second type is constructed through segmentation and merging based on a triangular irregular network. Each edge of this roof model is then projected to the terrain model to create a wall facet. The experimental results from its application to real data indicates that the building models of various shapes in wide areas are successfully generated. The proposed method is evaluated to be an cost and time effective method since it utilizes the existing data.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.20 no.1
• /
• pp.59-67
• /
• 2002

Recently, much demand of vector data have increased rapidly such as a digital map instead of traditional a paper map and the raster data such as a high-resolution orthoimage have been used for many GIS application with the advent of industrial high-resolution satellites and development of aerial optical sensor technologies. Aerial photogrammetric technologies using an airship can offer cost-effective and high-resolution color images as well as real time images, different from conventional remote sensing measurements. Also, it can acquire images easily and its processing procedure is short and simple relatively. On the other hand, it has often been used for the production of a small-scale land use map not required high accuracy, monitoring of linear infrastructure features through mosaicking strip images and construction of GIS data. Through this study, the developed aerial photogrammetric system using the airship expects to be applied to not only producing of scale 1:5, 000 digital map but also verifying, editing, and updating the digital map which was need to be reproduced. Further more, providing the various type of video-images, it expects to use many other GIS applications such as facilities management, scenery management and construction of GIS data for Urban area.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2017

Given a multi-dimensional dataset of tuples, a skyline query returns a subset of tuples which are not 'dominated' by any other tuples. Skyline query is very useful in Big data analysis since it filters out uninteresting items. Much interest was devoted to the MapReduce-based parallel processing of skyline queries in large-scale distributed environment. There are three requirements to improve parallelism in MapReduced-based algorithms: (1) workload should be well balanced (2) avoid redundant computations (3) Optimize network communication cost. In this paper, we introduce MR-SEAP (MapReduce sample Skyline object Equality Angular Partitioning), an efficient angular space partitioning based skyline query processing using sampling-based pruning, which satisfies requirements above. We conduct an extensive experiment to evaluate MR-SEAP.

• KIISE Transactions on Computing Practices
• /
• v.21 no.5
• /
• pp.387-392
• /
• 2015

MapReduce is a framework used to process large data sets in parallel on a large cluster. A group-by query is a query that partitions the input data into groups based on the values of the specified attributes, and then evaluates the value of the specified aggregate function for each group. In this paper, we propose an efficient method for processing multiple group-by queries using MapReduce. Instead of computing each group-by query independently, the proposed method computes multiple group-by queries in stages with one or more MapReduce jobs in order to reduce the total execution cost. We compared the performance of this method with the performance of a less sophisticated method that computes each group-by query independently. This comparison showed that the proposed method offers better performance in terms of execution time.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.770-771
• /
• 2008

This paper deals with cost reduction design of a single-phase line-start permanent magnet (LSPM) motor. The characteristic analysis according to the change of quantity of permanent magnet(PM) is examined by d-and q-axis equivalent circuit. The motor parameters which are satisfied with efficiency and maximum torque are determined by the characteristic map obtained by d-and q-axis equivalent circuit analysis. And then the geometric shape design using optimization methodology is performed by finite element method (FEM).