• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.87-93
• /
• 2003

Data Replication makes distributed system and database system improved in availability and performance. But it is difficult to keep strict consistency in data update. Existing algorithms keep strict consistency, but have problems of cost a great deal and delay time. It is to introduce hybrid update propagation algorithm which permits eager update for original copy and propagates lazy update for other copies. Hybrid update propagation algorithm also permits group update in ownership. This algorithm menages replica version in order to control group update consistency. Consistency and performance is improved by combining eager update and lazy update with group ownership. Simulation shows improvement of transaction throughput and response time depending on application and execution environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.732-735
• /
• 2011

Cloud computing is a new paradigm that adopts a pay-as-you-go business model. So, clients can ues the various resources, although they have not own the resources. Already, three big players of IT industry, namely Amazon, Google and Microsoft, develop the many applications for cloud computing. In this paper, we describe the data consistency requirements for cloud computing. Data characteristics of cloud computing is replicated, distributed and large-scaled. And consistency and availability of data cannot be satisfied simultaneously. In this paper, we categorized the applications of cloud computing, and describe requirements of consistency criteria for applications. With this result, we can make the base of consistency criteria that can be adapted for cloud computing, in the near future.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.457-467
• /
• 2004

The efficiency of algorithms managing data caches has a major impact on the performance of systems that utilize client-side data caching. In these systems, two versions of data can be maintained without an additional space overhead of the server by exploiting the replication of data in the server's buffer and clients' caches. In this paper, we present a new cache consistency algorithm employing versions: Two Versions-Callback Locking (2V-CBL). Our experimental results indicate that 2V-CBL provides good performance, particularly outperforms a leading cache consistency algorithm, Asynchronous Avoidance-based Gache Consistency, when some clients run only read-only transactions.

• The Korean Journal of Applied Statistics
• /
• v.33 no.3
• /
• pp.269-280
• /
• 2020

Time course gene expression data is a large amount of data observed over time in microarray experiments. This data can also simultaneously identify the level of gene expression. However, the experiment process is complex, resulting in frequent missing values due to various causes. In this paper, we propose a pattern consistency index adaptive nearest neighbors as a method of missing value imputation. This method combines the adaptive nearest neighbors (ANN) method that reflects local characteristics and the pattern consistency index that considers consistent degree for gene expression between observations over time points. We conducted a Monte Carlo simulation study to evaluate the usefulness of proposed the pattern consistency index adaptive nearest neighbors (PANN) method for two yeast time course data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.171-174
• /
• 2005

본 논문은 VOD 스트리밍 데이터에 대한 변형된 Scope Consistency 알고리즘 설계 방안을 제시한다. Consistency Model 은 주로 전자 계산에서 데이터 동기화에 적용될 수 있는 메커니즘이다. 그 중 Scope Consistency는 Memory Consistency Model의 한 종류로, Scope와 같은 lock을 사용하여 임계영역을 정의한다. Scope Consistency를 지원하는 시스템으로 JIAJIA가 있다. JIAJIA는 lock 기반 캐쉬 일관성을 구현한다. 본 논문에서는 JIAJIA에서 사용하는 동기화 메커니즘 중 barrier 메커니즘을 이용하여 일반적으로 전자 계산에서 사용되는 메커니즘을 VOD 스트리밍 데이터가 처리될 수 있는 변형된 Scope Consistency 알고리즘을 설계한다.

• Journal of Computing Science and Engineering
• /
• v.11 no.3
• /
• pp.92-99
• /
• 2017

Memcached, commonly used to speed up the data access in big-data and Internet-web applications, is a system software of the distributed-cache mechanism. But it is subject to the severe challenge of the loss of recently uncommitted updates in the case where the Memcached servers crash due to some reason. Although the replica scheme and the disk-log-based replay mechanism have been proposed to overcome this problem, they generate either the overhead of the replica synchronization or the persistent-storage overhead that is caused by flushing related logs. This paper proposes a scheme of backing up the write requests (i.e., set and add) on the Memcached client side, to reduce the overhead resulting from the making of disk-log records or performing the replica consistency. If the Memcached server fails, a timestamp-based recovery mechanism is then introduced to replay the write requests (buffered by relevant clients), for regaining the lost-data updates on the rebooted Memcached server, thereby meeting the data-consistency requirement. More importantly, compared with the mechanism of logging the write requests to the persistent storage of the master server and the server-replication scheme, the newly proposed approach of backing up the logs on the client side can greatly decrease the time overhead by up to 116.8% when processing the write workloads.

• Journal of Information Technology Services
• /
• v.8 no.2
• /
• pp.157-171
• /
• 2009

In mobile XML environments, the efficient synchronization technique is required to maintain the consistency of replicated XML data because the same data can be replicated between so many different XML documents. In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client XML documents and a server XML database in mobile XML environments. The proposed an XML data synchronization technique(XSA) has the advantage of model generality aspect and storage space aspect by using the tuple-based message digest table to detect the data conflicts. The proposed technique can be applicable to the application requiring the consistency of replicated XML data without any restrictions in the heterogeneous(between hierarchical XML documents and relational XML databases) mobile environments.

• 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 Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.421-431
• /
• 2007

Due to the rapid development of wireless communication technology, demands on data services in mobile computing environment are gradually increasing. In mobile computing environments, a mobile host began to use cache to overcome the weak point. Caching at mobile host could reduce the bandwidth consumption and query response time, but mobile host must maintain cache consistency. In this paper, we propose a cache consistency strategy to consider the period of data usage. The server allows an effective broadcasting by classifying data into two groups of periodic and non-periodic. By classifying the data, it prevent from elimination of cache after disconnection of periodic data by using expired time. By storing IR(Invalidation Report) messages, this scheme divides cached data by selection after disconnection. Consequently, we have shown much improvement in total consumption of bandwidth than the conventional scheme.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.10 no.2
• /
• pp.238-250
• /
• 1998

Vapor-liquid equilibrium apparatus is designed and set up. The vapor-liquid equilibrium data of the binary system HFC125/134a are measured in the range between 268.15 and 283.15K at five compositions. Twenty-five equilibrium data are obtained. To verify consistency of these data, they are tested for thermodynamic consistency. Based upon the present data, the binary interaction parameter for CSD and RKS equation of state is calculated at five isotherms and comparison with the data in the open literatures is made. Results of Nagel and Bier are in very good agreements with those from this study within 0.32∼1.11% for bubble point pressure and －0.66∼0.18% for vapor mole fraction.