• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.100-110
• /
• 2005

The update transactions to be executed in spatial databases usually have been known as interactive and long duration works. To improve the parallelism of concurrent updates, it needs multiple transactions concurrently update a large spatial object which has a spatial extensions larger than workspace of a client. However, under the existing locking protocols, it is not possible to concurrently update a large spatial object because of conflict of a write lock This paper proposes a partial locking scheme of enabling a transaction to set locks on parts of a big object. The partial locking scheme which is an exclusive locking scheme set by user, acquires locks for a part of the big object to restrict the unit of concurrency control to a partial object of a big object. The scheme gives benefits of improving the concurrency of un updating job for a large object because it makes the lock control granularity finer.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.186-192
• /
• 2021

Recently, the demand for more precise and demand-oriented customized spatial information is increasing due to the 4th industrial revolution. In particular, the use of 3D spatial information and digital twins which based on spatial information, and research for solving social problems in cities by using such information are continuously conducted. Globally, non-face-to-face services are increasing due to COVID-19, and the national policy direction is also rapidly progressing digital transformation, digitization and virtualization of the Korean version of the New Deal, which means that 3D spatial information has become an important factor to support it. In this study, physical objects for cities defined by world organizations such as ISO, OGC, and ITU were selected and the target of the 3D object model was limited to buildings. Based on CityGML2.0, the data collected using a drone suitable for building a 3D model of a small area is selected to be updated through road name address and building ledger, which are administrative information related to this, and LoD2.5 data is constructed and urban space. It was intended to suggest an object update method for a 3D building among data.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.3
• /
• pp.249-255
• /
• 2007

The building of spatial database such as digital maps has been extensively achieved as a base of geographic information system. However, in the GIS system built by the organizations including local autonomous entities, there are some problems technically and systematically for a promptly updating of GIS DB. This research is to develop the object-oriented database updating system to efficiently update the spatial data at any time for a small area. It could be managed the history of spatial database such as creation, modification and deletion at a object level using the UFID of spatial data. This system could help to modify or update the changed geographical features in an office or in-situ promptly. Finally, it could be made the efficient updating manner of geographic data and the assurance of newest database.

• Spatial Information Research
• /
• v.12 no.3
• /
• pp.239-249
• /
• 2004

This paper discusses on the update problem of multi-scale databases when the multi-scale databases, which is several spatial databases covering the same geographic area with different scales, are derived from an original one. Although the integrity between original and derived multi-scale databases should be maintained, most of update mechanisms do not 6respect it since the update mechanisms have assumed that the update of source objects propagates to objects directly derived from the source. In order to maintain the integrity of multi-scale databases during updates, we must propagate updates of sources to objects derived from both the updated source objects and other related objects. It is an important functional requirement of multi-scale database systems, which has not been supported by existing spatial database systems. In this paper, we propose a set of rules and algorithms for the update propagation and show a prototype developed on ArcGIS of ESRI. Our update mechanism provides with not only the consistency between multi-scale databases but also incremental updates.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.113-128
• /
• 2000

The adaptation of spatial view is to update materialized view objects when apatial view is redefined. There are tow kinds of adaptation : incremental updates and recomputation. The incremental update changes related view objects and it is more efficient than the recomputation which evaluates redefined view defining query because spatial view is defined by spatial query including high cost spatial operator. This paper proposes the several incremental update methods according to the types of changing the definition of a spatial view. There are two kinds of incremental view adaptation : the method of using only the existing view objects and the view derivation relationship between view objects and their sources. This incremental update is achieved by updating the current materialized view objects or by inserting new materialized view objects. Spatial view adapter is implemented and tested on top of the object oriented geographic information system. This paper evaluates performance between the recomputation and incremental update method through real data.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1276-1282
• /
• 2003

The works on the existing spatial indices have been proposed the retrieval methods. However, keeping track of the terminal location of moving objects is more important than the efficiency of the query processing in the moving object database. Therefore, many pure spatial indices are not applicable to the moving objects database which should maintain the object's current location as precise as possible. This paper proposes a method for reducing the construction time of indexing moving objects. We analyze the characteristics of the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a selective immediate update method using the properties of moving objects in order to minimize the number of database updates.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.5
• /
• pp.671-682
• /
• 1995

In this paper, we propose a multimedia query language MQL which defines and manipulates multimedia data as integration of monomedia data in time and space. The MQL is designed for a multimedia data model, called the object-relationship model, and based on the multimedia object calculus which formally describes operations on multimedia data. The SQL- like syntax for class definition and object manipulation, such as retrieval, insert, update, and delete, is defined. We show how the MQL can represent the user queries using composite temporal-spatial class structures and various relationships, such as equivalence and sequence.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.561-570
• /
• 2002

In order to evaluate the performance of incremental update algorithms, we perform experimental tests on the time of updating view objects. In this paper, the incremental update algorithms are evaluated on two kinds of materialized methods : materialization by value-copy and materialization by preserving object identifiers (OIDs). The result of performance evaluation shows that there is little difference in the updating time of view objects between two materialization methods. The evaluation of query processing on spatial views shows that materialization by value-copy is much better than materialization by preserving OIDs. As the results of overall performance evaluation, it is more desirable to use the incremental update method based on materialization by value-copy than the incremental update method based on materialization by preserving OIDs.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.51-62
• /
• 2004

Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.