• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.3
• /
• pp.275-284
• /
• 2008

The digital map needs efficiently updating. Because it is a base map at each local government and several geographic information systems and that is the key to enhancing to use spatial data. We suggest the linking method of building registers to the building layers of digital map, to update attribute data of the building layers. To conduct that, it is very important that each building in two data is linked by one-to-one matching. In this paper, we generate the strategy for renewing attribute data of the building layers based on identifier by using identifier of the new address system.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.4_1
• /
• pp.311-318
• /
• 2014

The data of buildings and structures take over large portions of the mapping database with large numbers. Furthermore, those shapes and attributes of building data continuously change over time. Due to those factors, the efficient methodology of updating database for following the most recent data become necessarily. This study has purposed on extracting needed data, which has been changed, by using overlaying analysis of new and old dataset, during updating processes. Following to procedures, we firstly searched for matching pairs of objects from each dataset, and defined the classification algorithm for building updating cases by comparing; those of shape updating cases are divided into 8 cases, while those of attribute updating cases are divided into 4 cases. Also, two updated dataset are set to be automatically saved. For the study, we selected few guidelines; the layer of digital topographic map 1:5000 for the targeted updating data, the building layer of Korea Address Information System map for the reference data, as well as build-up areas in Gwanak-gu, Seoul for the test area. The result of study updated 82.1% in shape and 34.5% in attribute building objects among all.

• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.99-107
• /
• 2020

An underground integrated map is being built for underground safety management and is being updated periodically. The map update proceeds with the procedure of deleting all previously stored objects and saving newly entered objects. However, even unchanged objects are repeatedly stored, deleted, and stored. That causes the delay of the update time. In this study, in order to shorten the update time of the integrated map, an updated object and an unupdated object are separated, and only updated objects are reflected in the underground integrated map, and a system implementing this technology is described. For the updated object, an object comparison method using the center point of the object is used, and a quad tree is used to improve the search speed. The types of updated objects are classified into addition and deletion using the shape of the object, and change using its attributes. The proposed system consists of update object detection, extraction, conversion, storage, and history management modules. This system has the advantage of being able to update the integrated map about four times faster than the existing method based on the data used in the experiment, and has the advantage that it can be applied to both ground and underground facilities.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.4
• /
• pp.359-372
• /
• 1999

Recently, the digital map of national basemap has been made through NGIS(National Geographic Information System) project in Korea. The digital map should have to be corrected or updated to cope with the changes in topography in future. For that, the efficient method correspond with digital map should be presented. Digital photogrammetric system has been considered as an efficient method for digital mapping because it provides the results in digital form, but the system if not fully tested because the commercial system is in early stage. This study aims to present the way to correct or update digital map using the digital photogrammetric system. Digital mapping in the environment of digitalphotogrammetric system was executed and the results were analyzed and compared with those from analytical plotter.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.731-734
• /
• 2005

학술지 정보는 다른 문헌 정보와는 달리 시간에 따라 지속적으로 변화하는 동적인 특성, 형태나 소장정보의 다양성, 정보 제공에 시한성 등이 있기 때문에 학술지 정보 데이터베이스의 자동구축과 실시간 갱신 등이 절대적으로 요구되고 있다. 학술지 소장기관마다 이질적인 학술지 정보 관리 시스템을 구축하고 있으며 학술지 정보 기술에도 서로 다른 형식을 사용하고 있기 때문에, 학술지 정보 통합 데이터베이스를 구축및 갱신하고자 할 때는 정보의 형태.의미적 충돌과 시스템 간의 부정합 문제가 야기된다. 본 연구에서는 이러한 문제를 해결하고 학술지 통합 테이터베이스의 자동 구축과 실시간 갱신할 수 있는 있는 효율적인 시스템을 제시한다.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.06a
• /
• pp.19-25
• /
• 2008

현재 우리나라의 수치지도는 5년 주기로 갱신되고 있어 국토변화에 신속하게 대응하지 못하는 문제점을 가지고 있다. 본 연구에서는 이러한 수치지도를 건설공사 준공도면을 활용한 수시갱신이 이루어 질 수 있도록 건설공사 현황, 관련규정, 해외사례 검토, 준공도면을 이용한 수치지도의 시범제작을 통해 현재의 관련규정 및 제도상의 문제점을 도출하고, 개선방안을 제시하였다. 이를 종합한 결과 수치지도 수시갱신을 위해 준공도면을 활용하기 위해서는 첫째, 준공도면의 명확한 정의와 세부지침의 마련이 필요하다. 둘째, 준공측량의 제도적 근거 마련과 성과심사가 필요하다. 셋째, 준공도면 작성비용의 부담주체 설정해야 한다. 넷째, 정보공유협력체계가 마련되어야 한다. 준공도면을 활용하여 수치지도를 수정하는 방법은 매우 효율적인 것으로 판단되며, 준공도면 제출제도를 활성화시키기 위한 노력을 통해 신속하고 정확한 수치지도를 제공할 수 있는 기반을 마련할 수 있을 것이다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.365-373
• /
• 2013

Tile caching technology is a commonly used method that optimizes the delivery of map imagery across the internet in modern WebGIS systems. However the poor performance of the map tile cache update is one of the major causes that hamper the wider use of this technique for datasets with frequent updates. In this paper, we introduce a new algorithm, namely, Partial Area Cache Update (PACU) that significantly minimizes redundant update of map tiles where the update frequency of source map data is very large. The performance of our algorithm is verified with the cadastral map data of Pyeongtaek of Gyeonggi Province, where approximately 3,100 changes occur in a day among the 331,594 parcels. The experiment results show that the performance of the PACU algorithm is 6.6 times faster than the ESRI ArcGIS SERVER$^{(r)}$. This algorithm significantly contributes in solving the frequent update problem and enable Web Map Tile Services for data that requires frequent update.

• Journal of Industrial Convergence
• /
• v.20 no.7
• /
• pp.57-64
• /
• 2022

There are various structures in the underground space, and the structures is managed as 3D data in Integrated Underground Geospatial Map Management System(IUGMMS). The worker transmits and updates the integrated map including the changed underground geospatial data to IUGMMS with the completed book submission program. However, there is a problem in that the transmission time and the update time is delayed because the size of the integrated map file is large. In this paper, we try to extract and transmit only the changed integrated map by obtaining and comparing each spatial characteristic information of the integrated map. As a result of the experiment, the transmission time of the suggestion method is short and the update time is also short than the transitional method because the suggestion method transmits only the integrated map including the changed underground geospatial data. As a result, it was possible to reduce the delay time in transmitting and updating the changed integrated map.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2007

The renewal update of the digital map constructed through NGIS has been conducted for the enhancement of usage, maintenance so that the latest data is guaranteed. The total update has been done every five years for five regions of the country using aerial photographs and satellite images. By launching the third phase of NGIS, the updating plan was changed from total to total or partial update including the real time update scheme. Furthermore, the update period was improved from five to two years and four years for a large and a small city, respectively. Therefore, it is necessary to develope a matching technique which combines various geographic information (such as drawing map, surveying drawing and map) with exact position on the digital map. In this study, we developed a matching algorithm based on central point and suggested a method which uses general surveying drawing for revision/update of the digital map. The general survey is conducted when a civilian development on lands are approved. Thus, the outcome from the survey, which is the general survey drawing, contains the latest various contents such as road, building, water pipe and manhole. A consistent and efficient method using the general survey drawing for near real time update of the digital map by applying the developed matching algorithm is presented.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.