• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.729-732
• /
• 2006

This paper proposes and implements consistency algorithm that is serviced streaming data efficiently in VOD system. The media data is loaded into each node by Round Robin method. The barrier mechanism is changed into the minimum data factor(SH. GOP) of media data in this paper. In addition in order to fast media data service, the additional features are implemented in the consistency algorithm. Additional feature of the consistency algorithm is added. First, time synchronization algorithm is added the suggested consistency algorithm. Second, the prepaging mechanism supports efficient buffering service. I experimented the suggested consistency algorithm on two DSM systems.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.8-16
• /
• 2006

This paper proposes and implements consistency algorithm that is serviced streaming data efficiently in VOD system. The media data is loaded into each node by Round Robin method. The barrier mechanism is changed into the minimum data factor(SH, GOP) of media data in this paper. In addition in order to fast media data service, the additional features are implemented in the consistency algorithm. Additional feature of the consistency algorithm is added. First, time synchronization algorithm is added the suggested consistency algorithm. Second, the prepaging mechanism supports efficient buffering service. I experimented the suggested consistency algorithm two DSM systems. The performance is good due to the last barrier algorithm.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.7-14
• /
• 2015

Storage Class Memory(SCM) has been considered as a next-generation storage device because it has positive advantages to be used both as a memory and storage. However, there are significant problems of data consistency in recently proposed file systems for SCM such as insufficient data consistency or excessive data consistency-control overhead. This paper proposes a novel data consistency-control scheme, which changes the write mode for log data depending on the modified data ratio in a block, using a rollback-recovery scheme instead of the Write Ahead Logging (WAL) scheme. The proposed scheme reduces the log data size and the synchronization cost for data consistency. In order to evaluate the proposed scheme, we implemented our scheme on a Linux 3.10.2-based system and measured its performance. The experimental results show that our scheme enhances the write throughput by 9 times on average when compared to the legacy data consistency control scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1414-1421
• /
• 2006

This paper proposes a consistency algorithm that is able to serve streaming data efficiently in VOD system. The media data is stripping into several pieces of data by the Round Robin method in order to media data service. The barrier mechanism is changed into the minimum data factor(SH. GOP) in this paper. The shared memory is allocated at one host with one fragment size. Data is combined with RTP packet transmission data format using barrier mechanism. I experiment and program the suggested algorithm on the VOD system.

• IE interfaces
• /
• v.16 no.2
• /
• pp.229-239
• /
• 2003

The On-Line Analytical Processing (OLAP) tools access data from the data warehouse for complex data analysis, such as multidimensional data analysis, and decision support activities. Current research has lead to new developments in all aspects of data warehousing, however, there are still a number of problems that need to be solved for making data warehousing effective. View maintenance, one of them, is to maintain view in response to updates in source data. Keeping the view consistent with updates to the base relations, however, can be expensive, since it may involve querying external sources where the base relations reside. In order to reduce maintenance costs, it is possible to maintain the views using information that is strictly local to the data warehouse. This process is usually referred to as "self-maintenance of views". A number of algorithm have been proposed for self maintenance of views where they keep some additional information in data warehouse in the form of auxiliary views. But those algorithms did not consider a consistency of materialized views using view self-maintenance. The purpose of this paper is to research consistency problem when self-maintenance of views is implemented. The proposed "conveyor algorithm" will resolved a complete consistency of materialized view using self-maintenance with considering network delay. The rationale for conveyor algorithm and performance characteristics are described in detail.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.193-205
• /
• 1997

It is required for multi-users to share massive mapping data effectively that distributed data model in the Client-Server environment is developed for the replication consistency. The existing model is not effective to the long transaction just like a mapping system, since it does not account lot consistency between GUI screen and database replications even though it emphasizes on the replication consistency. The performance of concurrency control is very important for those long transactions, especially the mapping systems. This model is to support consistency between GUI screen and replicas using display locks. It suggests consistency model improving process performance by modifying memory consistency model and optimistic concurrency control for mapping data's characteristics.

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.1
• /
• pp.157-164
• /
• 2002

In this paper, we consider the strong consistency of the regression quantiles estimators for the nonlinear regression models when dependent variables are subject to censoring, and provide the sufficient conditions which ensure the strong consistency of proposed estimators of the censored regression models. one example is given to illustrate the application of the main result.

• Journal of the Korean Mathematical Society
• /
• v.41 no.6
• /
• pp.1071-1086
• /
• 2004

This paper is concerned with the strong consistency of the estimators of the autocovariance function and the spectral density function for the autoregressive process in the case where only an amplitude modulated process with missing data is observed. These results will give a simple and practical sufficient condition for the strong consistency of those estimators. Finally, some examples are given to illustrate the application of main result.

• Journal of Information Technology Applications and Management
• /
• v.17 no.1
• /
• pp.83-105
• /
• 2010

The competence of enterprise for managing information is evaluated not by the amount of information but by the quality of information such as response time, data consistency, and data correctness. The degradation of data quality is usually caused by the inappropriate process of managing the structure and value of stored data. According to the recent survey on the actual condition of data quality management, the correctness and consistency of data appeared to be the most problematic area among the six criteria of data quality management such as correctness, consistency, availability, timeliness, accessibility, and security. Moreover, the problem was more serious in case of small and medium-sized companies than large enterprises. In this paper, therefore, we attempt to propose a new data quality control methodology for small and medium-sized companies that can improve the correctness and consistency of data without consuming too much time and cost. To adopt the proposed methodology to real application immediately, we provided some scripts for as-is analysis and devised automation tools for managing naming rules of vocabulary, terminology, and data code. Additionally, we performed case study on the distribution service of a small-sized company to estimate the applicability of our tool and methodology.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.1043-1046
• /
• 2006

Cached data management of clients is required to guarantee the correctness of client's applications. There are two categories of cache consistency algorithms : detection-based and avoidance-based cache consistency algorithm. Detection?.based schemes allow stale data access and then check the validity of any cached data before they ran be allowed to commit. In contrast, under avoidance-based algorithms, transactions never have the opportunity to access stale data. In this paper, we propose a new avoidance-based cache consistency algorithm make use of version. The proposed method maintains the two versions at clients and servers, so it has no callback message and it can be reduced abort ratio of transactions compare with the single-versioned algorithms. In addition to, the proposed method can be decreased cache miss using by mixed invalidation and propagation for remote update action.