• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.55-58
• /
• 2004

XML 의 중요성이 부각 되면서 XML 데이터의 효율적 관리 기법에 관한 연구가 활발히 수행되고 있다. XML 질의의 표준화 작업도 활발히 이루어져 현재 XQuery가 유력한 표준으로 부각되었다. 그러나 XQuery 등이 완전한 XML 질의어가 되기 위해서는 변경 연산을 제공해야 하는데 XML 변경어의 표준화 작업이나 XML 변경 처리 기법에 대한 연구는 아직 미미한 실정이다. 본 논문에서는 e-Business 등 XML 데이터베이스 기반 웹 응용의 효율적 지원을 위한 XML 문서 갱신에 대한 기법을 다룬다. XML 문서의 효율적 갱신을 위한 RN(RmdEid, NextChildEid) 번호 체계, R(RmdEid) 번호 체계 을 제시한다. 어떤 XML 번호 체계를 사용하여 XML 문서를 저장하는 가는 XML 문서의 갱신 연산에 중용한 영향을 미친다. 이들 번호 체계들은 데이터베이스내의 테이블 스키마의 차이점으로 구분한 것이다. 이들 번호체계 각각에 대하여 XML 데이터베이스 시스템을 구현하여 이들 기능의 성능 및 공간 부담을 평가한 결과를 기술한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.64-66
• /
• 2004

XML이 웹 상에서 데이터 교환의 표준으로 부각된 이래 XML데이터의 효율적 관리 기법에 관한 연구가 활발히 수행되고 있다. XML 질의의 표준화 작업도 활발히 이루어져 현재 XQuery가 유력한 표준으로 부각되었다. 그러나 XQuery 등이 완전한 XML 질의어가 되기 위해서는 변경 연산을 제공해야 하는데 XML변경어의 표준화 작업이나 XML 변경 처리 기법에 대한 연구는 아직 미미한 실정이다. 본 논문에서는 e-Commerce 등 XML 데이터베이스 기반 웹 응용의 효율적 지원을 위한 XML 캐쉬를 점진적으로 갱신하는 과정에서 발생하는 XML 변경 연산 처리의 세 가지 기본 모델. TD (텍스트/DOM 기반). PD(PDOM 기반), 그리고 IT (인덱스된 텍스트 기반)를 제안한다. 캐쉬된 XML 문서를 어떤 포맷으로 저장하는가는 이후 XML 변경 연산의 처리 및 요청된 XML문서 반환의 효율성에 영향을 미친다. 이들 모델들은 캐쉬된 XML 문서의 저장 포맷에 따라 구분한 것이다. 이들 모델 각각에 대하여 캐쉬된 XML문서의 갱신 및 반환 기능을 제공하는 XML캐쉬 관리 시스템을 구현하여 이들 기능의 성능 및 공간 부담을 평가한 결과를 기술한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.101-104
• /
• 2004

R-Tree 색인은 기존의 공간 데이터베이스관리시스템에서 공간 데이터 검색을 위하여 많이 사용되고 있는 공간 색인기법이다. 하지만 R-Tree 색인에서 기존의 잠금(Lock) 기반 동시성 제어는 갱신연산의 잠금으로 인해 검색연산의 블록킹 오버헤드(blocking overhead)가 발생한다. 본 논문에서는 R-Tree 색인에서 검색연산의 블록킹 오버헤드의 주요 원인이 되는 노드 분할 연산과 MBR(Minimum Bounding Rectangle) 갱신연산에 대해 각각 노드단위와 노드엔트리 단위의 버전(Version)을 생성하고 유지하여 동시에 발생하는 검색연산이 갱신연산으로 인한 지연이 없이 자신에 알맞은 버전을 읽음으로써, 검색성능을 높일 수 있는 버전 기반의 동시성 제어 기법을 제안한다.

• Geophysics and Geophysical Exploration
• /
• v.22 no.4
• /
• pp.202-209
• /
• 2019

In this study, an acoustic full-waveform inversion using Adam optimizer was proposed. The steepest descent method, which is commonly used for the optimization of seismic waveform inversion, is fast and easy to apply, but the inverse problem does not converge correctly. Various optimization methods suggested as alternative solutions require large calculation time though they were much more accurate than the steepest descent method. The Adam optimizer is widely used in deep learning for the optimization of learning model. It is considered as one of the most effective optimization method for diverse models. Thus, we proposed seismic full-waveform inversion algorithm using the Adam optimizer for fast and accurate convergence. To prove the performance of the suggested inversion algorithm, we compared the updated P-wave velocity model obtained using the Adam optimizer with the inversion results from the steepest descent method. As a result, we confirmed that the proposed algorithm can provide fast error convergence and precise inversion results.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.177-192
• /
• 2005

In this paper, we introduce a structural redundancy method. It reduces the query processing cost incurred when reconfiguring an XML document from divided XML data in shredding XML documents into relations. The fundamental idea is that query performance can be enhanced by analyzing query patterns and replicating data essential for the query performance. For the practical and effective structural redundancy, we analyzed three types of ID, VALUE, and SUBTREE replication. In addition, if given XML data and queries are very large and complex, it can be very difficult to search optimal redundancy set. Therefore, a heuristic search method is introduced in this paper. Finally, XML query processing cost arising by employing the structural redundancy, and the efficiency of proposed search method arc analyzed experimentally It is manifest that XML read query is performed more quick]y but XML update query is performed more slowly due to the additional update consistency cost for replicas. However, experimental results showed that in-place ID replication is useful even in having excessive update cost. It was also observed that multiple-place SUBTREE replication can enhance read query performance remarkably if only update cost is not excessive.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.647-654
• /
• 2003

The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.10
• /
• pp.51-59
• /
• 2003

A method of autonomous update is presented for onboard orbit propagator. On board propagator is an alternative means that could be used for navigation purpose in case of CPS receiver's failure. Although the ground station is not a able to upload a new propagator, the onboard propagator must be maintained most up-to-date. For this, a filtering technique is proposed wherein GPS data are effectively used to continuously update the on board propagator which was uploaded previously. Even if the ground station has generated the on board propagator based on the wrong information, the onboard propagator with updating scheme can automatically correct the errors in the coefficients of residual reconstruction function. Several scenarios were used to show the validity of the scheme for updating the onboard propagator using KOMPSAT-1 orbit data.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.605-612
• /
• 2004

In MIPv6, unauthenticated binding updates expose the involved MN and CN to various security attacks. Thus, protecting the binding update process becomes of paramount importance in the MIPv6, and several secure binding update protocols have been proposed. In this paper, we pro-pose a novel protocol for the secure binding updates in MIPv6, which can resolve the drawbacks of the Deng-Zhou-Bao's protocol ［2］, by adopt-ing Aura's CGA scheme with two hashes ［9］. Aura's scheme enables our protocol to achieve stronger security than other CGA-based protocols without a trusted CA, resulting in less cost of verifying the HA's public key than the Deng-Zhou-Bao's protocol. Through the comparison of our protocol with other protocols such as the Deng-Zhou-Bao's protocol, CAM-DH and SUCV, we show that our protocol can provide better performance and manageability in addition to stronger security than other approaches.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1035-1044
• /
• 2001

The existing search engine cause heavy loads on web servers and networks, because they operate robots not considering the loads of many distributed diverse web servers and networks. As the information update period is 3～4 weeks, information is not updated at proper time. Although there is no contents to be updated on web servers, the robot collects and updates the contents of the web servers. This study proposes a intelligential search engine considering the load of web servers and networks, designs a real-time controlled search engine and intelligent robots, and implements them. The intelligent robot updates distributed information real-time. Robot control policies are also proposed, which can upgrade the overall performance of the system by monitoring the loads of web servers and networks.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.327-338
• /
• 2001

The view can provide the user an appropriate portion of the database through data integration and filtering. Views can be materialized for query performance improvement, and in that cse, their consistency needs to be maintained against the updates of the underlying data. They can be either recomputed or incrementally refreshed by reflecting the relevant updates. Since XML could represent the structural information of the documents, for the XML materialized views, new techniques that differ from the previous ones for incrementally refreshing the relational views are required. In this paper, we propose a framework of XML materialized view management where the XML view derived from the underlying XML documents are materialized and incrementally refreshed against the updates of the underlying documents.