• Proceedings of the Korea Database Society Conference
• /
• 2001.11a
• /
• pp.428-434
• /
• 2001

전통적인 수작업을 통한 서비스 Update 수행 개선 필요. WMT 하의 Multimedia Streaming File 보안 필요. 기본 Web Page 및 HTML 하의 Player Skin의 통합 필요. 인터넷 재방(VOD/AOD)서비스에 대한 신속한 Update 구현 (중략)

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.967-973
• /
• 2014

A continuous object is large phenomenon diffusing continuously. Therefore, a large number of sources is a major problem in researches for continuous object. Existing studies for continuous object detecting focus on reducing communication cost generated by the sources. But, they only deal with the static sink located in fixed position. In this paper, we propose the location update scheme for mobile sinks in continuous object detecting. Generally, to receive data, a mobile sink should notice its current location to sources. Previous studies for location update of mobile sinks consider individual object. So they need a lot of energy for location update when a mobile sink notices its current location toward many sources of a continuous object independently. Proposed scheme exploits regional locality of the sources involved one continuous object. The regional locality makes the location update of mobile sinks efficient. Our simulation results show that the proposed scheme superior to existing schemes in terms of energy efficiency.

• Korean Journal of Remote Sensing
• /
• v.28 no.1
• /
• pp.55-67
• /
• 2012

Real-time image georeferencing is required to generate spatial information rapidly from the image sequences acquired by multi-sensor systems. To complement the performance of position/attitude sensors and process in real-time, we should employ on-line aerial triangulation based on a sequential estimation algorithm. In this study, we thus attempt to derive an efficient on-line aerial triangulation algorithm for real-time georeferencing of image sequences. We implemented on-line aerial triangulation using the existing Given transformation update algorithm, and a new inverse normal matrix update algorithm based on observation classification, respectively. To compare the performance of two algorithms in terms of the accuracy and processing time, we applied these algorithms to simulated airborne multi-sensory data. The experimental results indicate that the inverse normal matrix update algorithm shows 40 % higher accuracy in the estimated ground point coordinates and eight times faster processing speed comparing to the Given transformation update algorithm. Therefore, the inverse normal matrix update algorithm is more appropriate for the real-time image georeferencing.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1061-1072
• /
• 1999

한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.285-288
• /
• 2010

In this paper, we present a very useful method for updating digital satellite radio broadcast channel information. When a devices equipped with function to receive Digital Satellite Radio such as Home Theater, MP3 player, mobile phones, car audio system and various other types of Digital Devices, receives new Digital satellite radio (will be mentioned as XM radio onwards) broadcast channel information, only the current received XM radio broadcast channel and N number of pre/post nearby broadcast channels are scanned randomly in zigzag manner. Then the previous XM radio broadcast channel information updated with the newly received XM radio broadcast channel information. Since this method can prevent batch update for all XM radio channel, including some channels which less likely did not select by user, update process for real time frequently changed XM radio broadcast channel information can be performed efficiently with minimal or without delay.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.55-62
• /
• 2014

This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.477-490
• /
• 2006

Existing index structures need very much update cost because they repeat delete and insert operations in order to update continuously moving objects. In this paper, we propose a new index structure which reduces the update cost of continuously moving objects. The proposed index structure consists of a space partitioning index structure that stores the location of the moving objects and an auxiliary index structure that directly accesses to their current positions. In order to increase the fanout of the node, it stores not the real partitioning area but kd-tree as the information about the child node of the node. In addition, we don't traverse a whole index structure, but access the leaf nodes directly and accomplish a bottom-up update strategy for efficiently updating the positions of moving objects. We show through the various experiments that our index structure outperforms the existing index structures in terms of insertion, update and retrieval.

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

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.75-81
• /
• 2012

This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

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