• Spatial Information Research
• /
• v.20 no.5
• /
• pp.67-76
• /
• 2012

Recently the mobile DBMS (Database Management System) is popular to store and manage large data in a mobile device. Especially, the research and development about mobile storage structure and querying method for navigation map data in a mobile device have been performed. The performance of the mobile DBMS in which random data accesses are most queries if the NAND flash memory is used as storage media of the DBMS is degraded. The reason is that the performance of flash memory is good in writing sequentially but bad in writing randomly as the features of the NAND flash memory. So, new storage structure and querying policies of the mobile DBMS are needed in the mobile DBMS in which a flash memory is used as storage media. In this paper, we have studied the policy of the database page management to enhance the performance of the frequent random update and applied this policy to the navigation-specialized mobile DBMS which supports incremental map update. And also we have evaluated the performance of this policy by experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.272-284
• /
• 2010

Flash Memory differs from the hard disk, because it cannot be overwritten. Most of the flash memory file systems use not-in-place update mechanisms for the update. Flash memory file systems execute sometimes block cleaning process in order to make writable space while performing not-in-place update process. Block cleaning process collects the invalid pages and convert them into the free pages. Block cleaning process is a factor that affects directly on the performance of the flash memory. Thus this paper suggests the efficient page allocation method, which reduces block cleaning cost by minimizing the numbers of block that has valid and invalid pages at a time. The result of the simulation shows an increase in efficiency by reducing more block cleaning costs than the original YAFFS.

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

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.217-226
• /
• 2008

Branch prediction accuracy is critical for system performance in modern microprocessor architectures. The use of speculative update branch history provides substantial accuracy improvement in branch prediction. However, speculative update branch history is the information about uncommitted branch instruction and thus it may hurts program correctness, in case of miss-speculative execution. Therefore, speculative update branch history requires suitable recovery mechanisms to provide program correctness as well as performance improvement. In this paper, we propose recovery logics for speculative update branch history. The proposed solutions are recovery logics for both global history and local history. In simulation results, our solution provides performance improvement up to 5.64%. In addition, it guarantees the program correctness and almost 90% of additional hardware overhead is reduced, compared to previous works.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.259-268
• /
• 2004

For supporting Interoperability among heterogeneous data sources in different geographic information systems, it is required to use open API like OGIS OLE DB Proposed in OGC. The OLE/COM Implementation Specification of OGIS only provides interfaces to discover and access spatial data, but does not support interfaces for updating distributed spatial data. To solve this problem, we propose and add interfaces for updating spatial objects distributed over heterogeneous data sources and examining the consistency of spatial relationships between updated objects. We also devise a 2-phase commit protocol based on spatial relationships in order to guarantee the consistency of updated objects. To justify the update scheme using the proposed Interfaces and 2-phase commit prototype we design and implement a prototype system for updating distributed spatial objects.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.928-939
• /
• 2008

The grid database management system is used for large data processing, high availability and data integration by grid environment. It has a replica for processing performance and high availability in each node. The grid database has a problem of inconsistency, when the update is occurred with a coincidently frequent. To solve this problem, in this paper proposed a version management method for consistency in the grid database. Proposed version manager manages a version of each replica. The version manager keeps a consistency of update operation when is occurred at each node by using a pending queue and waiting queue. Also the node keeps a consistency using a priority queue. So, proposed method has stable and fast update propagation. The proposed method shows stable and faster update propagation than traditional method by performance evaluation.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1934-1935
• /
• 2011

In order for a service robot to perform several tasks, basically autonomous navigation technique such as localization, mapping, and path planning is required. The localization (estimation robot's pose) is fundamental ability for service robot to navigate autonomously. In this paper, we propose a new system for point pattern matching based visual global localization using spot lightings in ceiling. The proposed algorithm us suitable for system that demands high accuracy and fast update rate such a guide robot in the exhibition. A single camera looking upward direction (called ceiling vision system) is mounted on the head of the mobile robot and image features such as lightings are detected and tracked through the image sequence. For detecting more spot lightings, we choose wide FOV lens, and inevitably there is serious image distortion. But by applying correction calculation only for the position of spot lightings not whole image pixels, we can decrease the processing time. And then using point pattern matching and least square estimation, finally we can get the precise position and orientation of the mobile robot. Experimental results demonstrate the accuracy and update rate of the proposed algorithm in real environments.

• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.949-963
• /
• 2011

Generally, It is indispensible to use an ISP(In System Programming) tool for upgrading, patching, or changing the system software of the each sensor nodes in wireless sensor networks. While under a small number of nodes, the upgrading task is not a serious burden, however if there are a large number of nodes to be updated, the task is almost impossible to do for the given constrains such as limited budgets and resources. Based on this observation, in this paper we have proposed a novel upgrading scheme based on a single hop in IEEE 802.15.4 PAN(Personal Area Network)s. Simulation results have shown the scheme outcomes the conventional methods in the performance measures.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.743-747
• /
• 2009

We designed and implemented an automatic update system of 네비게이션 contents. Currently car users are updating map contents of their 네비게이션 system by using SD memory card. In the implemented system, map contents are downloaded via WI-FI internet access while served in a gas station. To prevent free rider at gas stations, we adopted authentication mechanism based on MAC address.